답안 #743743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743743 2023-05-17T20:46:40 Z MODDI Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
110 ms 6220 KB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int main(){
	int n;
	cin>>n;
	vi arr(n);
	for(int i = 0; i < n; i++)	cin>>arr[i];
	vector<ll> pref(n), suf(n);
	for(int i = 0; i < n-1; i++){
		pref[i+1] = pref[i] + max(0, arr[i] - arr[i+1] + 1);
	}
	for(int i = n-2; i >= 0; i--){
		suf[i] = suf[i+1] + max(0, arr[i+1] - arr[i] + 1);
	}
	ll ans = 2e15;
	for(int i = 0; i < n; i++){
		ans = min(ans, max(pref[i], suf[i]));
	}
	cout<<ans<<endl;

	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 73 ms 6152 KB Output is correct
27 Correct 77 ms 6076 KB Output is correct
28 Correct 91 ms 6068 KB Output is correct
29 Correct 110 ms 6056 KB Output is correct
30 Correct 59 ms 5412 KB Output is correct
31 Correct 76 ms 6056 KB Output is correct
32 Correct 77 ms 6064 KB Output is correct
33 Correct 79 ms 6220 KB Output is correct
34 Correct 82 ms 6096 KB Output is correct
35 Correct 54 ms 5304 KB Output is correct
36 Correct 58 ms 5408 KB Output is correct
37 Correct 59 ms 5452 KB Output is correct
38 Correct 85 ms 6052 KB Output is correct
39 Correct 103 ms 6052 KB Output is correct
40 Correct 77 ms 6112 KB Output is correct
41 Correct 77 ms 6052 KB Output is correct
42 Correct 69 ms 5924 KB Output is correct
43 Correct 75 ms 6092 KB Output is correct
44 Correct 83 ms 6056 KB Output is correct
45 Correct 78 ms 6092 KB Output is correct
46 Correct 79 ms 6064 KB Output is correct
47 Correct 76 ms 6060 KB Output is correct
48 Correct 75 ms 6108 KB Output is correct