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;
#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 2e5 + 5;
ll n, a[NMAX], L[NMAX], ans;
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> a[i];
L[i] = L[i - 1] + max(a[i - 1] - a[i] + 1, 0LL);
}
ans = 1e18;
ll cur = 0;
for(int i = n; i; i--){
if(i < n) cur += max(a[i + 1] - a[i] + 1, 0LL);
ans = min(ans, max(L[i], cur));
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |