제출 #941731

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
941731		Litusiano	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	0 / 100	1 ms	348 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
signed main(){
	int n; cin>>n;
	vector<int> v(n); for(int& i : v) cin>>i;
	vector<int> dp(n+1,inf), dp1(n+1,inf), mx(n+1,0), mx1(n+1,0);
	dp[0] = 0;
	mx[0] = 0;
	vector<int> last(n+1,0), last1(n+1,0); // just add max(between act and last)
	for(int i = 1; i<=n; i++){
		// cerr<<i<<" "<<v[i-1]<<" "<<dp[i-1]<<" "<<mx[i-1]<<endl;
		if(v[i-1] > mx[i-1]){
			mx[i] = v[i-1];
			dp[i] = dp[i-1]; continue;
		}
		int obj = mx[i-1] + 1;
		mx[i] = obj;
		dp[i] = dp[i-1] + abs(obj - v[i-1]);
	}
	dp1[n] = 0;
	mx1[n] = 0;
	for(int i = n-1; i>=0; i--){
		// cerr<<"dp1 "<<i<<" "<<v[i]<<" "<<dp1[i+1]<<" "<<mx1[i+1]<<" ";
		if(v[i] > mx1[i+1]){
			// cerr<<"not"<<endl;
			mx1[i] = v[i];
			dp1[i] = dp1[i+1];
			continue;
		}
		// cerr<<"yes ";
		int obj = mx1[i+1] + 1;
		// cerr<<obj<<" "<<v[i]<<endl;
		dp1[i] = dp1[i+1] + obj - v[i];
		mx1[i] = obj;
	}
	int ans = LLONG_MAX;
	for(int i = 0; i<=n; i++){
		// cerr<<"HERE "<<i<<" "<<dp[i]<<" "<<dp1[i]<<" "<<mx1[i]<<" "<<mx[i]<<endl;
		ans = min(ans, max(dp[i],dp1[i]) + max(0ll,mx1[i] + 1 - mx[i]));
	}
	cout<<ans<<endl;
}

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