#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;
for(int i=0; i<q; i++){
int l,r;
cin >> l >> r;
assert(l==1&&r==n);
}
long long suf[n];
suf[n-1]=arr[n-1];
for(int i=n-2; i>=0; i--) suf[i]=max(suf[i+1],arr[i]);
vector<pair<long long,int> > mono;
long long ans=0;
for(int i=0; i<n; i++){
while(!mono.empty()&&mono.back().first<=arr[i]){
int a=mono.back().second;
if(i*2-a<n) 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<n) ans=max(ans,arr[a]+arr[i]+suf[i*2-a]);
}
mono.push_back({arr[i],i});
}
cout << ans << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
3416 KB |
Output is correct |
2 |
Correct |
20 ms |
5328 KB |
Output is correct |
3 |
Correct |
20 ms |
10952 KB |
Output is correct |
4 |
Correct |
21 ms |
5308 KB |
Output is correct |
5 |
Correct |
20 ms |
5204 KB |
Output is correct |
6 |
Correct |
17 ms |
4440 KB |
Output is correct |
7 |
Correct |
16 ms |
4444 KB |
Output is correct |
8 |
Correct |
16 ms |
4444 KB |
Output is correct |
9 |
Correct |
18 ms |
4700 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |