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>
#define ll long long
using namespace std;
ll n, a[200001], l[200001], r[200001], ans=1e18;
int main() {
cin >> n;
for (int i=1; i<=n; i++) cin >> a[i];
for (int i=2; i<=n; i++){
if (a[i]<=a[i-1]) l[i]=a[i-1]-a[i]+1;
}
for (int i=n-1; i>=1; i--){
if (a[i]<=a[i+1]) r[i]=a[i+1]-a[i]+1;
}
for (int i=2; i<=n; i++) l[i]+=l[i-1];
for (int i=n-1; i>=1; i--) r[i]+=r[i+1];
for (int i=1; i<=n; i++) ans=min(ans, max(l[i], r[i]));
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |