Submission #1220956

#TimeUsernameProblemLanguageResultExecution timeMemory
1220956toast12Growing Vegetables is Fun 4 (JOI21_ho_t1)C++20
0 / 100
1 ms396 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(n+2);
    for (int i = 1; i <= n; i++) cin >> a[i];
    vector<int> inc(n+2), dec(n+2);
    for (int i = 2; i <= n; i++) inc[i] = inc[i-1]+ max(0, a[i-1]+1-a[i]);
    for (int i = n-1; i >= 1; i--) dec[i] = dec[i+1] + max(0, a[i+1]+1-a[i]);
    int ans = INT_MAX;
    for (int i = 1; i <= n; i++) ans = min(ans, max(inc[i], dec[i]));
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...