#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 24;
const ll INF = 1e18;
int n; ll a[N], b[N], pf[N], sf[N];
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i < n; i++) {
b[i] = a[i + 1] - a[i];
}
for (int i = 1; i <= n - 1; i++) {
pf[i] = pf[i - 1] + max(0LL, -b[i] + 1);
}
for (int i = n - 1; i >= 1; i--) {
sf[i] = sf[i + 1] + max(0LL, b[i] + 1);
}
ll res = INF;
for (int i = 0; i <= n - 1; i++) {
res = min(res, max(pf[i], sf[i + 1]));
}
cout << res << '\n';
}
int main() {
cin.tie(0) -> sync_with_stdio(0);
int T = 1; // cin >> T;
while (T--) {
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |