#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0);cin.tie(0);
int n;
cin >> n;
long long arr[n];
for(int i=0; i<n; i++) cin >> arr[i];
int q;
cin >> q;
while(q--){
int l,r;
cin >> l >> r;
l--; r--;
long long suf[n];
suf[r]=arr[r];
for(int i=r-1; i>=l; i--) suf[i]=max(suf[i+1],arr[i]);
vector<pair<long long,int> > mono;
long long ans=0;
for(int i=l; i<=r; i++){
while(!mono.empty()&&mono.back().first<=arr[i]){
int a=mono.back().second;
if(i*2-a<=r) ans=max(ans,arr[a]+arr[i]+suf[i*2-a]);
mono.pop_back();
}
if(!mono.empty()){
int a=mono.back().second;
if(i*2-a<=r) ans=max(ans,arr[a]+arr[i]+suf[i*2-a]);
}
mono.push_back({arr[i],i});
}
cout << ans << '\n';
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Execution timed out |
4046 ms |
3340 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
3420 KB |
Output is correct |
2 |
Correct |
18 ms |
3416 KB |
Output is correct |
3 |
Correct |
20 ms |
9428 KB |
Output is correct |
4 |
Correct |
19 ms |
3556 KB |
Output is correct |
5 |
Correct |
19 ms |
3556 KB |
Output is correct |
6 |
Correct |
16 ms |
3928 KB |
Output is correct |
7 |
Correct |
16 ms |
3416 KB |
Output is correct |
8 |
Correct |
16 ms |
3616 KB |
Output is correct |
9 |
Correct |
17 ms |
3552 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Execution timed out |
4046 ms |
3340 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |