Submission #1165261

#TimeUsernameProblemLanguageResultExecution timeMemory
1165261eri16Growing Vegetables is Fun 4 (JOI21_ho_t1)C++20
100 / 100
48 ms4936 KiB
#include <bits/stdc++.h> using namespace std; int main(){ long long int n; cin>>n; long long int arr[n],t_1[n],t_2[n],ans; memset(t_1, 0, sizeof(t_1)); memset(t_2, 0, sizeof(t_2)); t_1[0]=0;t_2[n-1]=0,ans=1e18; for (int i=0; i<n; i++){cin>>arr[i];} for (int i=1; i<n; i++){t_1[i]+=t_1[i-1]+max(0LL,arr[i-1]-arr[i]+1);} for (int i=n-2; i>=0; i--){t_2[i]+=t_2[i+1]+max(0LL,arr[i+1]-arr[i]+1);} for (int i=0; i<n; i++){ans=min(ans,t_1[i]+max(t_2[i]-t_1[i],0LL));} cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...