# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1077306 | quangminh412 | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++14 | 1095 ms | 3948 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;
/*
John Watson
https://codeforces.com/profile/quangminh98
Mua Code nhu mua Florentino !!
*/
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const int maxn = 2e5 + 9;
const ll oo = 1e18;
int n;
int a[maxn];
int b[maxn];
ll solve(int pos)
{
ll ans1 = 0;
ll ans2 = 0;
for (int i = 1; i <= pos; i++)
ans1 += max(0, 1 - b[i]);
for (int i = pos + 1; i <= n; i++)
ans2 += max(0, 1 + b[i]);
return max(ans1, ans2);
}
signed main()
{
if (fopen("test.inp", "r"))
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
faster();
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
b[i] = a[i] - a[i - 1];
}
ll res = 1e18;
for (int i = 1; i <= n; i++)
res = min(res, solve(i));
cout << res << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |