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>
#define fi first
#define se second
using namespace std;
const int N=2e5;
long long t[N+10];
long long p[N+10];
long long s[N+10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>t[i];
for(int i=1;i<=n+1;i++)
p[i]=p[i-1]+max(0LL,t[i-1]-t[i]+1);
for(int i=n;i>=0;i--)
s[i]=s[i+1]+max(0LL,t[i+1]-t[i]+1);
long long ans=p[n+1];
for(int i=0;i<=n+1;i++)
ans=min(ans,max(p[i],s[i]));
cout<<ans<<"\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |