This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n+2);
vector<ll> pref(n+2), suf(n+2);
for(int i=1; i<=n; i++) cin >> v[i];
for(int i=2; i<=n; i++) pref[i] = max(0, v[i-1]-v[i]+1) + pref[i-1];
for(int i=n-1; i>=1; i--) suf[i] = max(0, v[i+1]-v[i]+1) + suf[i+1];
ll ans = 1e18;
for(int i=1; i<=n; i++) ans = min(ans, max(pref[i], suf[i]));
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |