#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9+10;
struct func {
int h, i, l, r;
};
int n;
int mx[500000];
int mx2[500000];
int H[500000];
int eval(func f, int i) {
return f.h+(int)ceil(sqrt(i-f.i));
}
// returns when right part of func a intersects func b
int intersectRight(func a, func b) {
if (eval(a, n) >= eval(b, n)) return inf;
long long d = b.h-a.h;
if (b.i-a.i-d*d<0) return -1;
long double x = (b.i-a.i)/2.0/d-d/2.0;
long long ans = ceil(x*x-0.0001)+b.i;
assert(ans < n);
return ans;
}
void solveRight(int mx[]) {
stack<func> s;
for (int i = 0; i < n; i++) {
func f = {H[i], i, i, n-1};
while (!s.empty()) {
func f2 = s.top();
int intersect = intersectRight(f2, f);
//cout << f2.i << " intersects " << f.i << " at " << intersect << endl;
if (intersect <= f2.l) s.pop();
else {
if (intersect - 1 <= n-1) s.top().r = intersect - 1;
f.l = intersect;
break;
}
}
if (f.l <= n-1) s.push(f);
assert(f.l >= i);
}
while (!s.empty()) {
func f = s.top(); s.pop();
//cout << f.i << " is max from " << f.l << " to " << f.r << endl;
for (int i = f.l; i <= f.r; i++) mx[i] = max(mx[i], eval(f, i));
}
for (int i = 0; i < n; i++) {
//cout << "mx[" << i << "] = " << mx[i] << endl;
}
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> H[i]; mx[i] = H[i];
}
solveRight(mx);
for (int i = 0; i < n/2; i++) {
swap(H[i], H[n-i-1]);
}
solveRight(mx2);
for (int i = 0; i < n; i++) {
mx[i] = max(mx[i], mx2[n-1-i]);
}
for (int i = 0; i < n/2; i++) {
swap(H[i], H[n-i-1]);
}
for (int i = 0; i < n; i++) {
cout << mx[i]-H[i] << "\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
1024 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
1224 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
48 ms |
1536 KB |
Output is correct |
2 |
Correct |
24 ms |
1312 KB |
Output is correct |
3 |
Incorrect |
46 ms |
1656 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
73 ms |
1956 KB |
Output is correct |
2 |
Correct |
76 ms |
1912 KB |
Output is correct |
3 |
Incorrect |
56 ms |
2428 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
170 ms |
4152 KB |
Output is correct |
2 |
Correct |
158 ms |
3960 KB |
Output is correct |
3 |
Incorrect |
129 ms |
4604 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
264 ms |
8056 KB |
Output is correct |
2 |
Correct |
260 ms |
5988 KB |
Output is correct |
3 |
Incorrect |
202 ms |
7928 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
375 ms |
11256 KB |
Output is correct |
2 |
Correct |
374 ms |
8276 KB |
Output is correct |
3 |
Incorrect |
282 ms |
11268 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
374 ms |
8724 KB |
Output is correct |
2 |
Correct |
373 ms |
8184 KB |
Output is correct |
3 |
Incorrect |
292 ms |
11384 KB |
Output isn't correct |