제출 #1185875

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

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int arr[200'001];
ll pref_dif[200'001];
ll suf_dif[200'002];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n;
    cin >> n;
    rep2(i,1,n) cin >> arr[i];
    rep2(i,1,n)
    {
        pref_dif[i] = pref_dif[i-1];
        if(i != 1)
        {
            pref_dif[i] += max(0,arr[i-1] - arr[i]+1);
        }
    }
    for(int i = n; i >= 1; i--)
    {
        suf_dif[i] = suf_dif[i+1];
        if(i != n)
        {
            suf_dif[i] += max(0,arr[i+1] - arr[i]+1);
        }
    }
    ll ans = 1e18;
    rep2(i,1,n) ans = min(ans,max(pref_dif[i],suf_dif[i]));
    cout << ans << "\n";
}

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