Submission #395312

# Submission time Handle Problem Language Result Execution time Memory
395312 2021-04-28T06:55:32 Z Nordway Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
35 ms 8544 KB
#include<bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define sz(v) v.size()
#define up_b upper_bound
#define low_b lower_bound
#define all(v) v.begin(),v.end()

using namespace std;

typedef long long ll;
typedef long double ld;

const int N=2e5+11;
const ll mod=1e9+7;
const ll INF=1e18;

ll a[N],b[N];
ll pref[N],suf[N];

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(i>1)b[i-1]=a[i]-a[i-1];
	}
	for(int i=1;i<n;i++){
		pref[i]=pref[i-1]+max(-b[i]+1,0ll);
	}
	for(int i=n-1;i>=1;i--){
		suf[i]=suf[i+1]+max(b[i]+1,0ll);
	}
	ll res=INF;
	for(int i=1;i<=n;i++){
	//	cout<<pref[i-1]<<" "<<suf[i]<<endl;
		res=min(res,max(pref[i-1],suf[i]));
	}
	cout<<res;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 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 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 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 336 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 336 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 332 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 332 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 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 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 336 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 336 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 332 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 31 ms 8484 KB Output is correct
27 Correct 28 ms 8392 KB Output is correct
28 Correct 28 ms 8476 KB Output is correct
29 Correct 27 ms 8412 KB Output is correct
30 Correct 26 ms 7732 KB Output is correct
31 Correct 29 ms 8516 KB Output is correct
32 Correct 29 ms 8520 KB Output is correct
33 Correct 29 ms 8528 KB Output is correct
34 Correct 27 ms 8472 KB Output is correct
35 Correct 26 ms 7664 KB Output is correct
36 Correct 26 ms 7820 KB Output is correct
37 Correct 24 ms 7748 KB Output is correct
38 Correct 27 ms 8468 KB Output is correct
39 Correct 35 ms 8472 KB Output is correct
40 Correct 28 ms 8544 KB Output is correct
41 Correct 27 ms 8424 KB Output is correct
42 Correct 26 ms 8268 KB Output is correct
43 Correct 30 ms 8524 KB Output is correct
44 Correct 28 ms 8460 KB Output is correct
45 Correct 29 ms 8396 KB Output is correct
46 Correct 28 ms 8440 KB Output is correct
47 Correct 34 ms 8396 KB Output is correct
48 Correct 27 ms 8512 KB Output is correct