제출 #482901

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

Main

#include <bits/stdc++.h>
 
using namespace std;

const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 210000

ll n, a[maxn], sf[maxn], pf[maxn];

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

    //freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    cin >> n;

    for(ii i = 1; i <= n; i++) {
        cin >> a[i];
        
    }

    for(ii i = 2; i <= n; i++) {
        pf[i] = pf[i-1];
        pf[i]+= max(0LL,a[i-1]+1-a[i]);

    }

    for(ii i = n-1; i >= 1; i--) {
        sf[i] = sf[i+1];
        sf[i]+= max(0LL,a[i+1]+1-a[i]);
    }

    ll ans = INFll;
    for(ii i = 1; i <= n; i++) {
        ans = min(ans, max(sf[i],pf[i]));
        //cout << i << " " << pf[i] << " " << sf[i] << endl;
    }

    cout << ans << endl;
}

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