# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1221939 | TadijaSebez | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++20 | 20 ms | 4316 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=200050;
int a[N];
ll dpl[N],dpr[N];
int main(){
int n;
scanf("%i",&n);
for(int i=1;i<=n;i++)scanf("%i",&a[i]);
for(int i=2;i<=n;i++){
dpl[i]=dpl[i-1]+max(a[i-1]+1-a[i],0);
}
for(int i=n-1;i>=1;i--){
dpr[i]=dpr[i+1]+max(a[i+1]+1-a[i],0);
}
ll ans=dpr[1];
for(int i=1;i<=n;i++){
ans=min(ans,max(dpl[i],dpr[i]));
}
printf("%lld\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |