#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cstdio>
#include<cmath>
using namespace std;const int MAXN = 500005;struct INFO{int l, r, id;INFO(int L = 0, int R = 0, int ID = 0) {l = L; r = R; id = ID;}
}q[MAXN];
int n, hd, tl;
int a[MAXN], b[MAXN];
double f1[MAXN], f2[MAXN];inline int rd() {register int x = 0;register char c = getchar();while(!isdigit(c)) c = getchar();while(isdigit(c)) {x = x * 10 + (c ^ 48);c = getchar();}return x;
}
inline int hfs(int l, int r, int bck, int cur, int *arr) {register int mid = 0, ans = l;while(l <= r) {mid = ((l + r) >> 1);if((double)arr[bck] + sqrt(mid - bck) < (double)arr[cur] + sqrt(mid - cur)) {ans = mid;r = mid - 1;} else l = mid + 1;}return l;
}
inline void work(int *val, double *f) {hd = 1; tl = 0;q[++tl] = INFO(1, n, 1);for(int i = 2; i <= n; ++i) {++q[hd].l;//printf("i = %d, hd = %d, tl = %d\n", i, hd, tl);while(hd <= tl && q[hd].r < q[hd].l) ++hd;if((tl < hd) || ((double)val[i] + sqrt(n - i) > (double)val[q[tl].id] + sqrt(n - q[tl].id))) {while(hd <= tl && ((double)val[i] + sqrt(q[tl].l - i) > (double)val[q[tl].id] + sqrt(q[tl].l - q[tl].id))) --tl;if(tl < hd) {q[++tl] = INFO(i, n, i);} else {register int dst = hfs(q[tl].l, q[tl].r, q[tl].id, i, val);q[tl].r = dst - 1;q[++tl] = INFO(dst, n, i);}}f[i] = (double)val[q[hd].id] + sqrt(i - q[hd].id) - val[i];}return;
}int main() {n = rd();for(int i = 1; i <= n; ++i) a[i] = b[n - i + 1] = rd();work(a, f1);work(b, f2);for(int i = 1; i <= n; ++i) printf("%d\n", max(0, (int)ceil(max(f1[i], f2[n - i + 1]))));return 0;
}