Submission #1188008

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