Submission #617258

#TimeUsernameProblemLanguageResultExecution timeMemory
617258HanksburgerGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++17
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> using namespace std; int a[200005]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, l, r, ans=0; cin >> n; for (int i=1; i<=n; i++) cin >> a[i]; l=1; r=n; while (a[l]<a[l+1]) l++; while (a[r-1]>a[r]) r--; while (l+2<=r) { int x=min(a[l]-a[l+1], a[r]-a[r-1])+1; ans+=x; a[l]-=x; a[r]-=x; while (a[l]<a[l+1]) l++; while (a[r-1]>a[r]) r--; } cout << ans+r-l; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...