제출 #541299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
541299		NyanCatTW1	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	26 ms	6936 KiB

Main

#include <iostream>
#include <vector>

using namespace std;
typedef long long LL;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int N;
    cin >> N;

    vector<LL> heights(N);
    for (int i = 0; i < N; i++) {
        cin >> heights[i];
    }

    vector<LL> LHeights(N);
    for (int i = 1; i < N; i++) {
        LHeights[i] = LHeights[i - 1] + max(0LL, heights[i - 1] - heights[i] + 1);
    }

    vector<LL> RHeights(N);
    for (int i = N - 2; i >= 0; i--) {
        RHeights[i] = RHeights[i + 1] + max(0LL, heights[i + 1] - heights[i] + 1);
    }

    LL ans = max(LHeights[0], RHeights[0]);
    for (int i = 1; i < N; i++) {
        ans = min(ans, max(LHeights[i], RHeights[i]));
    }

    cout << ans << '\n';
}

• Subtask 1: 40 / 40
• Subtask 2: 60 / 60