Submission #774557

#	Time	Username	Problem	Language	Result	Execution time	Memory
774557		kirakaminski968	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	0 / 100	1 ms	308 KiB

Main

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 2e5+5;
ll arr[MAXN],f[MAXN],g[MAXN];
ll INF = 1e18;
int main()
{
    int N; cin >> N;
    for(int i = 1;i<=N;++i) cin >> arr[i];
    for(int i = 1;i<=N;++i){
        f[i] = f[i-1]+max(arr[i+1]-arr[i]+1,0ll);
    }
    for(int i = N;i>=0;--i){
        g[i] = g[i+1]+max(arr[i+1]-arr[i]+1,0ll);
    }
    ll ans = INF;
    for(int i = 1;i<=N;++i){
        ans = min(max(f[i],g[i]),ans);
    }
    cout << ans << "\n";
    return 0;
}

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