Submission #1187996

#TimeUsernameProblemLanguageResultExecution timeMemory
1187996miniobGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; int a[200007]; int pref[200007]; int suf[200007]; int main() { int n; cin >> n; for(int i = 1; i <= n; i++) { cin >> a[i]; pref[i] = pref[i - 1] + max(a[i - 1] - a[i] + 1, 0); } for(int i = n; i > 0; i--) { suf[i] = suf[i + 1] + max(a[i + 1] - a[i] + 1, 0); } int odp = INT_MAX; for(int i = 1; i <= n; i++) { odp = min(odp, pref[i] + suf[i]); } cout << odp << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...