Submission #826108

#TimeUsernameProblemLanguageResultExecution timeMemory
82610812345678Growing Vegetables is Fun 4 (JOI21_ho_t1)C++17
0 / 100
1 ms340 KiB
#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5;
int n, v[nx], l[nx], r[nx], ans;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>v[i];
    for (int i=2; i<=n; i++) l[i]=max(v[i-1]-v[i], -1)+1+l[i-1];
    for (int i=n-1; i>=1; i--) r[i]=max(v[i+1]-v[i], -1)+1+r[i+1];
    ans=min(l[n], r[1]);
    for (int i=1; i<n; i++) ans=min(ans, max(l[i], r[i+1])+(v[i]+l[i]==v[i+1]+r[i+1]));
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...