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, i;
cin >> n;
vector<ll> P(n), S(n), v(n);
for(i=0; i<n; i++) cin >> v[i];
for(i=1; i<n; i++) P[i] = max(0ll, v[i-1]-v[i]+1) + P[i-1];
for(i=n-2; i>=0; i--) S[i] = max(0ll, v[i+1]-v[i]+1) + S[i+1];
ll ans = 1e18;
for(i=0; i<n; i++) ans = min(ans, max(P[i], S[i]));
cout << ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |