답안 #936742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936742 2024-03-02T16:30:08 Z vjudge1 Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
22 ms 11148 KB
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAXN = 1e6 + 7;
const ll INF = 1e18 + 7;
const int logo = 20;
const int off = 1 << logo;

ll pf[MAXN], arr[MAXN], sf[MAXN];

void solve(){
	int n;
	cin >> n;
	for(int i=1; i<=n; i++) cin >> arr[i];
	for(int i=2; i<=n; i++){
		pf[i] = pf[i - 1];
		if(arr[i] <= arr[i - 1]) pf[i] += 1 + arr[i - 1] - arr[i];
	}
	
	for(int i=n-1; i; i--){
		sf[i] = sf[i + 1];
		if(arr[i] <= arr[i + 1]) sf[i] += 1 + arr[i + 1] - arr[i];
	}
	
	ll ans = INF;
	for(int i=1; i<=n; i++) ans = min(ans, max(pf[i], sf[i]));
	cout << ans << "\n";
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2536 KB Output is correct
18 Correct 1 ms 2524 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2536 KB Output is correct
18 Correct 1 ms 2524 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 20 ms 10696 KB Output is correct
27 Correct 19 ms 10800 KB Output is correct
28 Correct 21 ms 10836 KB Output is correct
29 Correct 19 ms 10836 KB Output is correct
30 Correct 15 ms 10328 KB Output is correct
31 Correct 19 ms 10844 KB Output is correct
32 Correct 18 ms 10908 KB Output is correct
33 Correct 20 ms 10836 KB Output is correct
34 Correct 19 ms 10836 KB Output is correct
35 Correct 16 ms 10076 KB Output is correct
36 Correct 18 ms 10332 KB Output is correct
37 Correct 17 ms 10304 KB Output is correct
38 Correct 19 ms 11036 KB Output is correct
39 Correct 18 ms 10876 KB Output is correct
40 Correct 19 ms 10836 KB Output is correct
41 Correct 22 ms 11148 KB Output is correct
42 Correct 18 ms 10884 KB Output is correct
43 Correct 18 ms 10924 KB Output is correct
44 Correct 18 ms 10744 KB Output is correct
45 Correct 19 ms 10832 KB Output is correct
46 Correct 19 ms 10836 KB Output is correct
47 Correct 19 ms 10832 KB Output is correct
48 Correct 18 ms 10840 KB Output is correct