Submission #879013

#TimeUsernameProblemLanguageResultExecution timeMemory
87901312345678Triple Jump (JOI19_jumps)C++17
0 / 100
15 ms4440 KiB
#include <bits/stdc++.h> using namespace std; const int nx=2e5+5; int n, q, a[nx], dpl[nx], dpr[nx], res; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n; for (int i=1; i<=n; i++) cin>>a[i], dpl[i]=max(dpl[i-1], a[i]); for (int i=n; i>=1; i--) dpr[i]=max(dpr[i+1], a[i]); for (int i=2; i<n; i++) if (dpl[i-1]+dpr[i+1]>=2*a[i]) res=max(res, dpl[i-1]+dpr[i+1]+a[i]); cin>>n>>n>>n; cout<<res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...