#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=300005;
int mx[N*4];
ll ans[N],f[N],g[N];
int n;
int a[N];
void build(int l,int r,int x)
{
	if (l==r)
	{
		mx[x]=l;
		return;
	}
	int mid=(l+r)/2;
	build(l,mid,x*2);
	build(mid+1,r,x*2+1);
	mx[x]=(a[mx[x*2]]>a[mx[x*2+1]]?mx[x*2]:mx[x*2+1]);
	// cout<<l<<' '<<r<<' '<<mx[x]<<endl;
}
int ask(int l,int r,int L,int R,int x)
{
	if (l==L&&r==R)
		return mx[x];
	int mid=(l+r)/2;
	if (R<=mid)
		return ask(l,mid,L,R,x*2);
	if (L>mid)
		return ask(mid+1,r,L,R,x*2+1);
	int la=ask(l,mid,L,mid,x*2),ra=ask(mid+1,r,mid+1,R,x*2+1);
	return a[la]>a[ra]?la:ra;
}
int work(int l,int r)
{
	if (l>r)
		return 0;
	int mid=ask(1,n,l,r,1);
	// cout<<l<<' '<<r<<' '<<mid<<endl;
	int ls=work(l,mid-1);
	int rs=work(mid+1,r);
	f[mid]=f[ls]+f[rs]+r-mid+1;
	g[mid]=g[ls]+g[rs]+mid-l+1;
	// cout<<l<<' '<<r<<' '<<mid<<' '<<f[mid]<<' '<<g[mid]<<endl;
	ans[l]+=f[rs]+r-mid+1;
	ans[mid]-=r-mid+1;
	ans[mid+1]-=f[rs];
	ans[mid]+=g[ls];
	ans[mid+1]+=mid-l+1;
	ans[r+1]-=mid-l+1;
	return mid;
}
int main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;++i)
		scanf("%d",&a[i]);
	build(1,n,1);
	work(1,n);
	ll sum=0;
	for (int i=1;i<=n;++i)
	{
		sum+=ans[i];
		printf("%lld ",sum);
	}
	return 0;
}