Submission #384954

#TimeUsernameProblemLanguageResultExecution timeMemory
384954timmyfengGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++17
100 / 100
28 ms3180 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<int> a(n);
    for (auto &i : a) {
        cin >> i;
    }

    long long ans = LLONG_MAX, left = 0, right = 0;
    for (int i = 1; i < n; ++i) {
        right += max(0, a[i] - a[i - 1] + 1);
    }

    for (int i = 0; i < n; ++i) {
        ans = min(ans, max(left, right));
        if (i < n - 1) {
            left += max(0, a[i] - a[i + 1] + 1);
            right -= max(0, a[i + 1] - a[i] + 1);
        }
    }

    cout << ans << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...