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;
typedef long long ll;
int n;
ll a[200002];
ll b[200002];
ll c[200002];
int main(){
ios_base::sync_with_stdio(false), cin.tie(nullptr);
cin >> n;
for(int i=1; i<=n; i++) cin >> a[i];
for(int i=1; i<=n; i++){
b[i] = b[i-1] + max(a[i-1]-a[i]+1, 0ll);
}
for(int i=n; i; i--){
c[i] = c[i+1] + max(a[i+1]-a[i]+1, 0ll);
}
ll ret = 1e18;
for(int i=1; i<=n; i++){
ret = min(ret, max(b[i], c[i]));
}
cout << ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |