| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 944180 | kxd | Chameleon's Love (JOI20_chameleon) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif
using namespace std;
const int N = 2e5+5;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;
int a[N], mx[N];
signed main() {
//INIT
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
///////////
int n;
cin >> n;
forn1(i,n) {
cin >> a[i];
}
mx[n] = a[n];
for(int i = n-1; i >= 1; i--) {
mx[i]=max(mx[i+1],a[i]);
}
int q;
cin >> q;
int l, r;
cin >> l >> r;
int ans = 0;
deque<int> dq;
dq.push_back(1);
for(int j = 2; j <= r-1; j++) {
//cout << i << ' ' << j << '|' << j+1 << ' ' << min(r,j+(j-i)) << endl;
for(auto it = prev(dq.end()); ;it--) {
int i = *(it);
int k = mx[j+(j-i)];
chmax(ans,a[i]+a[j]+k);
if(k==mx[1]) break;
if(it==dq.begin()) break;
}
while(dq.size()&&a[dq.back()]<=a[j]) dq.pop_back();
dq.push_back(j);
}
cout << ans << endl;
}