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 <iostream>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<LL> heights(N);
for (int i = 0; i < N; i++) {
cin >> heights[i];
}
vector<LL> LHeights(N);
for (int i = 1; i < N; i++) {
LHeights[i] = LHeights[i - 1] + max(0LL, heights[i - 1] - heights[i] + 1);
}
vector<LL> RHeights(N);
for (int i = N - 2; i >= 0; i--) {
RHeights[i] = RHeights[i + 1] + max(0LL, heights[i + 1] - heights[i] + 1);
}
LL ans = max(LHeights[0], RHeights[0]);
for (int i = 1; i < N; i++) {
ans = min(ans, max(LHeights[i], RHeights[i]));
}
cout << ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |