Submission #503329

#	Time	Username	Problem	Language	Result	Execution time	Memory
503329		WongChun1234	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	0 / 100	1 ms	332 KiB

Main

#include<bits/stdc++.h>
using namespace std;
const int MAXN=200050;
int n,a[MAXN],frnt[MAXN],bck[MAXN],curr,cb=INT_MAX;
int main(){
	cin>>n;
	for (int i=1;i<=n;i++) cin>>a[i];
	curr=a[1];
	for (int i=2;i<=n;i++){
		curr=max(curr+1,a[i]);
		frnt[i]=max(frnt[i-1],curr-a[i]);
	}
	curr=a[n];
	for (int i=n-1;i>=1;i--){
		curr=max(curr+1,a[i]);
		bck[i]=max(bck[i+1],curr-a[i]);
	}
	for (int i=1;i<=n;i++) cb=min(cb,max(frnt[i],bck[i]));
	cout<<cb<<"\n";
}

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