Submission #926666

#TimeUsernameProblemLanguageResultExecution timeMemory
926666VMaksimoski008Growing Vegetables is Fun 4 (JOI21_ho_t1)C++14
100 / 100
65 ms4440 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n, i; cin >> n; vector<int> v(n); vector<ll> pref(n), suf(n); for(i=0; i<n; i++) cin >> v[i]; for(i=1; i<n; i++) pref[i] = max(0, v[i-1]-v[i]+1) + pref[i-1]; for(i=n-2; i>=0; i--) suf[i] = max(0, v[i+1]-v[i]+1) + suf[i+1]; ll ans = 1e18; for(i=0; i<n; i++) ans = min(ans, max(pref[i], suf[i])); cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...