捞

#include<cstdio>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;
int read(){
	int p=0;char ch=getchar();
	while(ch<'0'||ch>'9') ch=getchar();
	while(ch>='0'&&ch<='9') p=(p<<1)+(p<<3)+(ch^48),ch=getchar();
	return p;
}
const int N=500005;
int n,g[N];
double f[N],sq[N],dp[N];
ll a[N];
double cost(int l,int r){
	return a[l]+sq[r-l];
}
void dfs(int l,int r,int L,int R){
	int mid=l+r>>1;
	for(int i=L;i<=min(mid,R);i++){
		if(cost(i,mid)>f[mid]){
			f[mid]=cost(i,mid);
			g[mid]=i;
		}
	}
	if(l<mid) dfs(l,mid-1,L,g[mid]);
	if(r>mid) dfs(mid+1,r,g[mid],R);
}
int main(){
	n=read();
	for(int i=1;i<=n;i++){
		a[i]=read();
		sq[i]=sqrt(i);
	}
	dfs(1,n,1,n);
	for(int i=1;i<=n;i++) g[i]=0; 
	for(int i=1;i<=n/2;i++){
		swap(a[i],a[n-i+1]);
		swap(f[i],f[n-i+1]);
	}
	dfs(1,n,1,n);
	for(int i=n;i;i--){
		printf("%d\n",(int)ceil(f[i])-a[i]);
	}
	return 0;
}

for(int i=1;i<=n;i++) g[i]=0;