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>
#define int long long
#define fi first
#define se second
using namespace std;
const int inff = 1e18;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> p(n);
for (int i = 1; i < n; i++) p[i] = max(p[i - 1], a[i - 1] + p[i - 1] + 1 - a[i]);
vector<int> s(n);
for (int i = n - 2; i >= 0; i--) s[i] = max(s[i + 1], a[i + 1] + s[i + 1] + 1 - a[i]);
int ans = inff;
for (int i = 0; i < n; i++) ans = min(ans, max(p[i], s[i]));
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |