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;
int n;
vector<int> solve(vector<int> &h) {
vector<int> ans(n), mi(n, 0);
int hi = 0;
for (int i = 0; i < n; i++) {
hi = max(hi, mi[i]);
ans[i] = max(0, hi - h[i]);
for (int j = 0; i + j*j + 1 < n; j++)
mi[i+j*j+1] = max(mi[i + j*j + 1], h[i] + j + 1);
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> ans = solve(h);
reverse(h.begin(), h.end());
vector<int> ans2 = solve(h);
reverse(ans2.begin(), ans2.end());
stringstream ss;
for (int i = 0; i < n; i++)
ss << max(ans[i], ans2[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... |