Submission #926669

#TimeUsernameProblemLanguageResultExecution timeMemory
926669VMaksimoski008Growing Vegetables is Fun 4 (JOI21_ho_t1)C++14
100 / 100
81 ms5140 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int n, i;
    cin >> n;
    
    vector<ll> P(n), S(n), v(n);
    for(i=0; i<n; i++) cin >> v[i];
    for(i=1; i<n; i++) P[i] = max(0ll, v[i-1]-v[i]+1) + P[i-1];
    for(i=n-2; i>=0; i--) S[i] = max(0ll, v[i+1]-v[i]+1) + S[i+1];

    ll ans = 1e18;
    for(i=0; i<n; i++) ans = min(ans, max(P[i], S[i]));
    cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...