#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int &i : a) cin >> i;
for (int i = 1; i < n; i++) {
a[i - 1] = a[i] - a[i - 1];
}
a.pop_back();
n--;
vector<long long> l(n), r(n);
for (int i = 0; i < n; i++) {
l[i] = max(0, -a[i] + 1);
if (i) l[i] += l[i - 1];
}
for (int i = n - 1; i >= 0; i--) {
r[i] = max(0, a[i] + 1);
if (i + 1 < n) r[i] += r[i + 1];
}
long long ans = min(r[0], l[n - 1]);
for (int i = 0; i + 1 < n; i++) {
ans = min(ans, max(l[i], r[i + 1]));
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |