Submission #528101

#TimeUsernameProblemLanguageResultExecution timeMemory
528101JasiekstrzGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++17
100 / 100
29 ms6940 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...