#include <bits/stdc++.h>
using namespace std;
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;
int mono[n],cnt=0;
long long suf[n];
while(q--){
int l,r;
cin >> l >> r;
l--; r--;
cnt=0;
suf[r]=arr[r];
for(int i=r-1; i>=l; i--) suf[i]=max(suf[i+1],arr[i]);
long long ans=0;
for(int i=l; i<=r; i++){
while(cnt!=0&&arr[mono[cnt-1]]<=arr[i]){
int a=mono[cnt-1];
if(i*2-a<=r) ans=max(ans,arr[a]+arr[i]+suf[i*2-a]);
cnt--;
}
if(cnt!=0){
int a=mono[cnt-1];
if(i*2-a<=r) ans=max(ans,arr[a]+arr[i]+suf[i*2-a]);
}
mono[cnt]=i;
cnt++;
}
cout << ans << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 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 |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 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 |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Execution timed out |
4022 ms |
8924 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
5976 KB |
Output is correct |
2 |
Correct |
17 ms |
5848 KB |
Output is correct |
3 |
Correct |
17 ms |
5772 KB |
Output is correct |
4 |
Correct |
18 ms |
5716 KB |
Output is correct |
5 |
Correct |
20 ms |
5636 KB |
Output is correct |
6 |
Correct |
15 ms |
5212 KB |
Output is correct |
7 |
Correct |
15 ms |
5296 KB |
Output is correct |
8 |
Correct |
15 ms |
5300 KB |
Output is correct |
9 |
Correct |
16 ms |
5720 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 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 |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Execution timed out |
4022 ms |
8924 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |