//記得跳題
#include<iostream>
#include<array>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<unordered_map>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<tuple>
#define ll long long
#define LL __int128_t
#define DB double
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define INF (ll)(1e9)
#define MOD (ll)(1e9+7)
#define F first
#define S second
#define endl "\n"
#define AC ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
template<class T> using PQ=priority_queue<T,vector<T>,less<T> >;
void file(){
freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
}
int s[200005],seg[800005];
void build(int id,int l,int r){
if(l==r){
seg[id]=s[l]; return;
}
int mid=(l+r)>>1;
build(id*2,l,mid);
build(id*2+1,mid+1,r);
seg[id]=max(seg[id*2],seg[id*2+1]);
}
int ask(int id,int l,int r,int L,int R){
if(l>R||r<L) return 0;
if(L<=l&&r<=R) return seg[id];
int mid=(l+r)>>1;
return max(ask(id*2,l,mid,L,R),ask(id*2+1,mid+1,r,L,R));
}
signed main(){
AC;
int n,q; cin>>n>>q;
FOR(i,1,n+1) cin>>s[i];
build(1,1,n);
while(q--){
int t,l,r; cin>>t>>l>>r;
cout<<ask(1,1,n,l-t,r)<<endl;
}
}
/*
*/
Compilation message
ho_t5.cpp: In function 'void file()':
ho_t5.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t5.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
38 | freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
134 ms |
8156 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
147 ms |
8260 KB |
Output is correct |
3 |
Correct |
137 ms |
10568 KB |
Output is correct |
4 |
Correct |
159 ms |
10836 KB |
Output is correct |
5 |
Correct |
130 ms |
10472 KB |
Output is correct |
6 |
Correct |
138 ms |
10604 KB |
Output is correct |
7 |
Correct |
143 ms |
10600 KB |
Output is correct |
8 |
Correct |
143 ms |
10692 KB |
Output is correct |
9 |
Correct |
144 ms |
10708 KB |
Output is correct |
10 |
Correct |
138 ms |
10520 KB |
Output is correct |
11 |
Correct |
133 ms |
10748 KB |
Output is correct |
12 |
Correct |
130 ms |
10552 KB |
Output is correct |
13 |
Correct |
132 ms |
10776 KB |
Output is correct |
14 |
Correct |
143 ms |
10528 KB |
Output is correct |
15 |
Correct |
136 ms |
10640 KB |
Output is correct |
16 |
Correct |
144 ms |
10484 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
126 ms |
6640 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |