# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
460631 | Baray | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++17 | 0 ms | 0 KiB |
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 <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
int n, maxx = -1, maxpos, ans = INT_MAX;
int main() {
cin >> n;
vector<int> arr(n), pre(n), suf(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 1; i < n; i++) {
pre[i] = pre[i - 1] + max(0, arr[i - 1] + 1 - arr[i]);
}
for (int i = n - 2; i >= 0; i--) {
suf[i] = suf[i + 1] + max(0, arr[i + 1] + 1 - arr[i]);
}
for (int i = 0; i < n - 1; i++) {
ans = min(ans, max(suf[i], pre[i + 1]));
}
cout << ans;
}