# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598598 | MasterTaster | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++14 | 0 ms | 0 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 <iostream>
#define MAXN 200010
using namespace std;
long long n, a[MAXN], b[MAXN], ress;
int main() {
cin>>n;
for (int i=0; i<n; i++) cin>>a[i];
for (int i=1; i<n; i++) b[i-1]=a[i]-a[i-1];
long long levo, desno;
levo=desno=0;
for (int i=0; i<n-1; i++) desno+=max(0, (b[i]+1));
ress=desno;
for (int i=0; i<n-1; i++)
{
levo+=max(0LL, 1LL-b[i]);
desno-=max(0LL, b[i]+1LL);
ress=min(ress, max(levo, desno));
}
cout<<ress;
}