Submission #1219381

#TimeUsernameProblemLanguageResultExecution timeMemory
1219381boclobanchatGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++20
100 / 100
12 ms1216 KiB
#include<bits/stdc++.h>
using namespace std;
const int MAXN=2e5+5;
int A[MAXN];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>A[i];
    for(int i=n;i;i--) A[i]-=A[i-1];
    int r=n-1;
    long long ans=0;
    for(int i=1;i<=r;i++)
    {
    	while(A[i]<=0&&i<r)
    	{
    		int sum=max(0,min(-A[i]+1,A[r]+1));
    		A[i]+=sum,A[r]-=sum,ans+=sum;
    		if(A[r]<0) r--;
		}
		if(A[i]==0) ans++;
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...