| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 567785 | Baytoro | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++17 | 28 ms | 6992 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 Baytoro_Mayrambekov void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
const int INF=1e18;
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
if(n==0)
return 1;
if(n%2==1)
return binpow(a, n-1)*a;
else{
int b=binpow(a, n/2);
return b*b;
}
}
int a,b,c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_Mayrambekov{
cin>>n;
vector<int> vec(n+2),pref(n+2),suf(n+2);
vec[0]=-INF;
vec[n+1]=-INF;
for(i=1;i<=n;i++){
cin>>vec[i];
}
for(i=1;i<=n;i++){
pref[i]=pref[i-1]+max(vec[i-1]-vec[i]+1,0ll);
}
for(i=n;i>0;i--){
suf[i]=suf[i+1]+max(vec[i+1]-vec[i]+1,0ll);
}
res=1e18;
for(i=1;i<=n;i++)
res=min(res,max(pref[i],suf[i]));
cout<<res<<endl;
}
main(){
ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
