# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
756818 | Bula | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++17 | 1 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
main(){
int n;
cin>>n;
vector<int> v(n+1),pref(n+2),suf(n+2);
for(int i=1;i<=n;i++) cin>>v[i];
for(int i=2;i<=n;i++){
pref[i]=pref[i-1];
if(v[i]<=v[i-1]) pref[i]+=(v[i-1]+1)-v[i];
}
for(int i=n-1;i>=1;i--){
suf[i]=suf[i+1];
if(v[i]<=v[i+1]) suf[i]+=(v[i+1]+1)-v[i];
}
int ans=INT_MAX;
for(int i=1;i<=n;i++){
ans=min(ans,max(pref[i],suf[i]));
}
cout<<ans<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |