Submission #676063

#TimeUsernameProblemLanguageResultExecution timeMemory
676063ToroTNGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++14
100 / 100
29 ms6932 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long ll n,a[200005],l[200005],r[200005],ans; int main() { ios_base::sync_with_stdio(0),cin.tie(0); cin >> n; for(int i=1;i<=n;i++)cin >> a[i]; for(int i=2;i<=n;i++) { l[i]=l[i-1]; if(a[i]<=a[i-1])l[i]+=a[i-1]-a[i]+1; } for(int i=n-1;i>=1;i--) { r[i]=r[i+1]; if(a[i]<=a[i+1])r[i]+=a[i+1]-a[i]+1; } ans=min(l[n],r[1]); for(int i=1;i<n;i++)ans=min(ans,max(l[i],r[i+1])+(l[i]+a[i]==r[i+1]+a[i+1])); cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...