제출 #372318

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

Main

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define up upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n;
ll arr[200005];
ll le[200005];
ll ri[200005];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n;
	rep(x,0,n) cin>>arr[x];
	rep(x,1,n) le[x]=le[x-1]+max(arr[x-1]-arr[x]+1,0LL);
	rep(x,n-1,0) ri[x]=ri[x+1]+max(arr[x+1]-arr[x]+1,0LL);
	
	//rep(x,0,n) cout<<le[x]<<" "<<ri[x]<<endl;
	
	ll ans=1e18;
	rep(x,0,n){
		ans=min(ans,max(le[x],ri[x]));
	}
	
	cout<<ans<<endl;
}

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