제출 #391582

#제출 시각아이디문제언어결과실행 시간메모리
391582l3nl3Growing Vegetables is Fun 4 (JOI21_ho_t1)C++17
0 / 100
1 ms204 KiB
#include <bits/stdc++.h>

using namespace std;

const int mxsz = 2e5 + 10;
const int inf = 1e9 + 7;

int n, a[mxsz], b[mxsz], p[mxsz], s[mxsz], mn=inf;

int main () {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        b[i] = a[i] - a[i-1];
        p[i] = p[i-1] + max(0, 1-b[i]);
    }
    for (int i = n; i >= 1; i--) {
        s[i] = s[i+1] + max(0, b[i] + 1);
    }
    for (int i = 1; i <= n; i++) {
        mn = min(mn, max(p[i], s[i]));
    }
    cout << mn;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...