Submission #725485

#TimeUsernameProblemLanguageResultExecution timeMemory
725485khanhdz06Growing Vegetables is Fun 4 (JOI21_ho_t1)C++17
100 / 100
33 ms6952 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n;
ll a[200002];
ll b[200002];
ll c[200002];

int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    cin >> n;
    for(int i=1; i<=n; i++) cin >> a[i];
    for(int i=1; i<=n; i++){
        b[i] = b[i-1] + max(a[i-1]-a[i]+1, 0ll);
    }
    for(int i=n; i; i--){
        c[i] = c[i+1] + max(a[i+1]-a[i]+1, 0ll);
    }
    ll ret = 1e18;
    for(int i=1; i<=n; i++){
        ret = min(ret, max(b[i], c[i]));
    }
    cout << ret;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...