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;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
long long res = 1e18;
for (int i = 0; i < n; i++) {
long long A = 0, B = 0;
for (int j = 0; j < i; j++) {
A += max(0, v[j] - v[j + 1] + 1);
}
for (int j = n - 1; j > i; j--) {
B += max(0, v[j] - v[j - 1] + 1);
}
res = min(res, max(A, B));
}
cout << res << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |