# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096688 | 2024-10-05T02:26:53 Z | nguyenvu | Triple Jump (JOI19_jumps) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl "\n" #define F first #define S second const ll ool=1e18; const int ooi=1e9; const int MOD=1e9+7; const int N=5e5; int n,m; int a[N+5],x[N+5]; void subtask1(int l,int r) // O(n*n) { ll ans=0; for (int i=1;i<=n;i++) x[i]=0; for (int i=r;i>=l;i--) x[i]=max(x[i+1],a[i]); for (int i=l;i<r-1;i++) for (int j=i+1;j<r;j++) ans=max(ans,1LL*x[j-i+j]+a[i]+a[j]); cout<<ans<<endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n; for (int i=1;i<=n;i++) cin>>a[i]; cin>>m; for (int i=1;i<=m;i++) { int l,r; cin>>l>>r; subtask1(); } }