Submission #396911

# Submission time Handle Problem Language Result Execution time Memory
396911 2021-05-01T01:15:04 Z AQT Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
30 ms 6148 KB
#include <bits/stdc++.h>

using namespace std;

int N;
int arr[200005];
/*
int mnpre[200005];
long long sumpre[200005];
int mnsuf[200005];
long long sumsuf[200005];
*/
long long mxpre[200005];
long long mxsuf[200005];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N;
	for(int i = 1; i <= N; i++){
		cin >> arr[i];
	}
	/*
	for(int i = 1; i <= N; i++){
		mnpre[i] = max(arr[i], mnpre[i-1] + 1);
		sumpre[i] = sumpre[i-1] + mnpre[i] - arr[i];
	}
	for(int i = N; i; i--){
		mnsuf[i] = max(arr[i], mnsuf[i+1] + 1);
		sumsuf[i] = sumsuf[i+1] + mnsuf[i] - arr[i];
	}
	long long ans = LLONG_MAX/2;
	for(int i = 1; i <= N; i++){
		int lft = mnpre[i-1];
		int rht = mnsuf[i+1];
		long long tot = sumpre[i-1] + sumsuf[i+1];
		tot += max({lft, rht, arr[i]}) - arr[i];
		ans = min(ans, tot);
	}
	cout << ans;
	*/
	for(int i = 1; i <= N; i++){
		mxpre[i] = max(0, arr[i-1] + 1 - arr[i]);
		mxpre[i] += mxpre[i-1];
	}
	for(int i = N; i; i--){
		mxsuf[i] = max(0, arr[i+1] + 1 - arr[i]);
		mxsuf[i] += mxsuf[i+1];
	}
	long long ans = LLONG_MAX;
	for(int i = 1; i <= N; i++){
		ans = min(ans, max(mxsuf[i], mxpre[i]));
	}
	cout << ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 29 ms 6048 KB Output is correct
27 Correct 28 ms 6124 KB Output is correct
28 Correct 26 ms 6140 KB Output is correct
29 Correct 27 ms 6148 KB Output is correct
30 Correct 27 ms 5384 KB Output is correct
31 Correct 26 ms 6040 KB Output is correct
32 Correct 27 ms 6048 KB Output is correct
33 Correct 27 ms 6132 KB Output is correct
34 Correct 26 ms 6088 KB Output is correct
35 Correct 21 ms 5316 KB Output is correct
36 Correct 27 ms 5388 KB Output is correct
37 Correct 23 ms 5444 KB Output is correct
38 Correct 27 ms 6068 KB Output is correct
39 Correct 29 ms 6064 KB Output is correct
40 Correct 28 ms 6148 KB Output is correct
41 Correct 28 ms 6084 KB Output is correct
42 Correct 25 ms 5892 KB Output is correct
43 Correct 26 ms 6076 KB Output is correct
44 Correct 26 ms 6076 KB Output is correct
45 Correct 30 ms 6020 KB Output is correct
46 Correct 26 ms 6088 KB Output is correct
47 Correct 25 ms 6092 KB Output is correct
48 Correct 27 ms 6100 KB Output is correct