제출 #1125406

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

Main

#include <bits/stdc++.h>
#define pb push_back
#define endl ("\n")
#define all(aa) aa.begin(), aa.end()
typedef long long ll;
using namespace std;

int main(){
	int n;
	cin >> n;
	vector<int> a(n);
	for(int i = 0; i < n; i++) cin >> a[i];
	vector<ll> pref(n), suf(n);
	for(int i = 1; i < n; i++){
		pref[i] = pref[i - 1];
		if(a[i - 1] >= a[i]){
			pref[i] += a[i - 1] - a[i] + 1;
		}
	}

	for(int i = n - 2; i >= 0; i--){
		suf[i] = suf[i + 1];
		if(a[i + 1] >= a[i]){
			suf[i] += a[i + 1] - a[i] + 1;
		}
	}

	ll ans = LLONG_MAX;
	for(int i = 0; i < n; i++){
		ans = min(ans, max(suf[i], pref[i]));
	}

	cout << ans << endl;
}

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