제출 #1356407

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

Main

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

#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(v) v.begin(),v.end()
#define FILE(v) freopen(v".inp", "r", stdin),freopen(v".out", "w", stdout)
#define int ll

typedef long long ll;
typedef long double ld;

///------------------------------------------------///

/// VARIABLE
const int INF = 1e18;
const int MAXN = 2e5 + 5;
int n;
int a[MAXN];
int dpL[MAXN], dpR[MAXN];

/// FUNCTIONS


/// PROCESS
void read()
{
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
}

void solve()
{
    for (int i = 1; i <= n; i++) dpL[i] = dpL[i - 1] + max(0LL, a[i - 1] - a[i] + 1);
    for (int i = n; i >= 1; i--) dpR[i] = dpR[i + 1] + max(0LL, a[i + 1] - a[i] + 1);

    int ans = INF;
    for (int i = 1; i <= n; i++)
    {
        ans = min(ans, max(dpL[i], dpR[i]));
    }
    cout << ans << '\n';
}

/// MAIN
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

//    FILE("test");

    int T = 1;
    bool multitest = false;
    if (multitest) cin >> T;

    double st = clock();
    while (T--)
    {
        read();
        solve();
    }
    double en = clock();
    cerr << fixed << setprecision(3) << (en - st) / CLOCKS_PER_SEC;

    return 0;
}

• 서브태스크 1: 40 / 40
• 서브태스크 2: 60 / 60