제출 #460735

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

Main

    #include <iostream>
    #include <vector>
    #include <set>
    #include <queue>
    #include <stack>
    #include <algorithm>
    #include <climits>
     
    using namespace std;
     
    long long n, ans = 1000000000000000;
     
    int main() {
        cin >> n;
     
        vector<long long> arr(n), pre(n), suf(n);
        suf[n - 1] = 0;
        pre[0] = 0;
     
        for (long long i = 0; i < n; i++) {
            cin >> arr[i];
        }
     
        for (long long i = 1; i < n; i++) {
            pre[i] = pre[i - 1] + max(0ll, arr[i - 1] + 1 - arr[i]);
        }
     
        for (long long i = n - 2; i >= 0; i--) {
            suf[i] = suf[i + 1] + max(0ll, arr[i + 1] + 1 - arr[i]);
        }
      
      	//ans = min(suf[0], pre[n - 1]);
      	pre[0] = 0;
      	suf[n - 1] = 0;
      
        for (long long i = 0; i < n; i++) {
            ans = min(ans, max(suf[i], pre[i]));
        }
     
        cout << ans << "\n";
    }

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