# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
756790 | pera | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++17 | 88 ms | 7064 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 30000 + 1;
main(){
int n;cin >> n;
vector<int> a(n + 1) , p(n + 1) , s(n + 2) , A(n + 1);
for(int i = 1;i <= n;i ++){
cin >> a[i];
A[i] = a[i];
}
for(int i = 2;i <= n;i ++){
p[i] = p[i - 1];
if(a[i] <= a[i - 1]) p[i] += a[i - 1] - a[i] + 1;
}
for(int i = n - 1;i >= 1;i --){
s[i] = s[i + 1];
if(a[i] <= a[i + 1]) s[i] += a[i + 1] - a[i] + 1;
}
int ans = LLONG_MAX;
for(int i = 1;i <= n;i ++){
ans = min(ans , max(p[i] , s[i]));
}
cout << ans << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |