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 int long long
int a[(int)(2e5 + 5)], p[(int)(2e5 + 5)], s[(int)(2e5 + 5)];
signed main(){
int n; cin >> n;
for(int i = 1; i < n + 1; i++) cin >> a[i];
for(int i = 1; i < n + 2; i++) p[i] = p[i - 1] + max(0ll, a[i - 1] - a[i] + 1);
for(int i = n; i > -1; i--) s[i] = s[i + 1] + max(0ll, a[i + 1] - a[i] + 1);
int ans = INT_MAX;
for(int i = 1; i < n + 1; 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... |