1 #include <cstdio>
 2 #include <iostream>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm> 
 6 #include <cstdlib>
 7 using namespace std;
 8 const int N=500010;
 9 int n,a[N],id[N];
10 double ans[N],f[N];
11 double get(int x,int y) { return a[x]+f[abs(x-y)]; }
12 void cdq(int l,int r,int L,int R)
13 {
14     if (l>r) return;
15     int mid=l+r>>1,pos=0; double mx=0;
16     for (int i=L;i<=R&&i<=mid;i++) if (get(i,mid)>mx) mx=get(i,mid),pos=i;
17     ans[id[mid]]=max(ans[id[mid]],mx),cdq(l,mid-1,L,pos),cdq(mid+1,r,pos,R);
18 } 
19 int main()
20 {
21     scanf("%d",&n);
22     for (int i=1;i<=n;i++) scanf("%d",&a[i]),f[i]=sqrt(i),id[i]=i;
23     cdq(1,n,1,n);
24     for (int i=1;i<=n/2;i++) swap(a[i],a[n-i+1]),swap(id[i],id[n-i+1]);
25     cdq(1,n,1,n);
26     for (int i=1;i<=n;i++) printf("%d\n",(int)ceil(ans[i]-a[n-i+1]));
27 }