#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=3e5+5,M=(1<<15)+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,p[N],st[N],sh,L[N],R[N];ll f[N][2],ans[N];
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d",&p[i]);
	for(i=1;i<=n;i++){
		while(sh&&p[st[sh]]<p[i]) sh--;
		L[i]=st[sh];st[++sh]=i;
	}
	st[sh=0]=n+1;
	for(i=n;i;i--){
		while(sh&&p[st[sh]]<p[i]) sh--;
		R[i]=st[sh];st[++sh]=i;
	}
	vector<pii> E;
	for(i=1;i<=n;i++) E.emplace_back(i,L[i]),E.emplace_back(i,R[i]);
	sort(E.begin(),E.end(),[](pii x,pii y){return abs(x.fi-x.se)<abs(y.fi-y.se);});
	for(auto i:E){
		int op=(i.fi<i.se);
		int x=min(i.fi,i.se),y=max(i.fi,i.se);
		f[i.fi][op]=y-x-1;
		if(i.se!=n+1){
			sh=0;
			for(int j=x+1;j<y;j++) {
				while(sh&&p[st[sh]]<p[j]) sh--;
				st[++sh]=j;
			}
			for(j=1+(i.se!=0);j<=sh;j++) f[i.fi][op]+=f[st[j]][0];
		}
		if(i.se!=0){
			sh=0;
			for(int j=y-1;j>x;j--){
				while(sh&&p[st[sh]]<p[j]) sh--;
				st[++sh]=j;
			}
			for(j=1+(i.se!=n+1);j<=sh;j++) f[i.fi][op]+=f[st[j]][1];
		}
	}
	ll tot=0;sh=0;
	for(i=1;i<=n;i++){
		while(sh&&p[st[sh]]<p[i]) tot-=f[st[sh--]][0];
		st[++sh]=i;tot+=f[i][0];
		ans[i]+=tot;
	}
	tot=0;sh=0;
	for(i=n;i;i--){
		while(sh&&p[st[sh]]<p[i]) tot-=f[st[sh--]][1];
		st[++sh]=i;tot+=f[i][1];
		ans[i]+=tot;
	}
	// for(i=1;i<=n;i++) cerr<<f[i][0]<<' '<<f[i][1]<<'\n';
	for(i=1;i<=n;i++) printf("%lld ",ans[i]+n-1-(R[i]-L[i]-2));
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}