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;
const int N = 5e5+7;
int n;
int h[N];
int L[N], R[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
memset(L,0,sizeof(L));
memset(R,0,sizeof(R));
for (int i = 0; i < n; i++)
cin>>h[i];
for (int i = 0; i < n; i++) {
if (i) L[i] = max(L[i], L[i-1]);
for (int j = 0; i+j*j+1 < n; j++)
L[i+j*j+1] = max(L[i+j*j+1], h[i] + j + 1);
}
reverse(h, h+n);
for (int i = 0; i < n; i++) {
if (i) R[i] = max(R[i], R[i-1]);
for (int j = 0; i+j*j+1 < n; j++)
R[i+j*j+1] = max(R[i+j*j+1], h[i] + j + 1);
}
reverse(h, h+n);
stringstream ss;
for (int i = 0; i < n; i++)
ss << max(0, max(L[i], R[n-1-i]) - h[i]) << endl;
cout << ss.str();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |