Submission #598601

#TimeUsernameProblemLanguageResultExecution timeMemory
598601MasterTasterGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++14
100 / 100
95 ms5432 KiB
#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(0LL, (b[i]+1LL)); 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...