Submission #795769

#TimeUsernameProblemLanguageResultExecution timeMemory
7957691binGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++14
100 / 100
25 ms5368 KiB
#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 2e5 + 5;
ll n, a[NMAX], L[NMAX], ans;

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        L[i] = L[i - 1] + max(a[i - 1] - a[i] + 1, 0LL);
    }
    ans = 1e18;
    ll cur = 0;
    for(int i = n; i; i--){
        if(i < n) cur += max(a[i + 1] - a[i] + 1, 0LL);
        ans = min(ans, max(L[i], cur));
    }
    cout << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...