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;
long long a[200005], l[200005], r[200005];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, ans=1e18;
cin >> n;
for (int i=1; i<=n; i++)
cin >> a[i];
for (int i=2; i<=n; i++)
l[i]=l[i-1]+max(0LL, a[i-1]-a[i]+1);
for (int i=n-1; i>=1; i--)
r[i]=r[i+1]+max(0LL, a[i+1]-a[i]+1);
for (int i=1; i<=n; i++)
ans=min(ans, max(l[i], r[i]));
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |