Submission #617281

#TimeUsernameProblemLanguageResultExecution timeMemory
617281HanksburgerGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++17
0 / 100
1 ms340 KiB
#include <bits/stdc++.h>
using namespace std;
int a[200005], l[200005], r[200005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, ans=2e9;
    cin >> n;
    for (int i=1; i<=n; i++)
        cin >> a[i];
    for (int i=2; i<=n; i++)
        l[i]=l[i-1]+max(0, a[i-1]-a[i]+1);
    for (int i=n-1; i>=1; i--)
        r[i]=r[i+1]+max(0, a[i+1]-a[i]+1);
    for (int i=1; i<=n; i++)
        ans=min(ans, l[i]+r[i]);
    cout << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...