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