제출 #415443

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

Main

// vaziat meshki-ghermeze !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ll Mod = 1000000007LL;
const int N = 2e5 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

int a[N], b[N];

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	for(int i = 1; i < n; i++)
		b[i] = a[i + 1] - a[i];
	ll sm = 0;
	ll sm2 = 0;
	for(int i = 1; i < n; i++) if(b[i] >= 0) sm += (b[i] + 1);
	ll ans = sm;
	for(int i = 1; i < n; i++){
		if(b[i] >= 0) sm -= (b[i] + 1);
		if(b[i] <= 0) sm2 += (-b[i] + 1);
		ans = min(ans, max(sm, sm2));
	}
	cout << ans << '\n';
	return 0;
}

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