#include <cstdio>

using namespace std;

const int N = 3e5 + 500;
const int OFF = (1 << 19);

typedef long long ll;

ll Lmax[2 * OFF], Rmax[2 * OFF];
ll Lprop[2 * OFF], Rprop[2 * OFF];
ll *T, *prop;
int p[N], n;

void refresh(int x, int len) {
	T[x] += prop[x] * len;
	if(x < OFF) {
		prop[2 * x] += prop[x];
		prop[2 * x + 1] += prop[x];
	}
	prop[x] = 0;
}

void update(int i, int a, int b, int lo, int hi, int x) {
	if(lo <= a && b <= hi) {
		prop[i] += x; refresh(i, b - a + 1); return;
	}	
	refresh(i, b - a + 1);
	if(a > hi || b < lo) return;
	update(2 * i, a, (a + b) / 2, lo, hi, x);
	update(2 * i + 1, (a + b) / 2 + 1, b, lo, hi, x);
	T[i] = T[2 * i] + T[2 * i + 1];
}

int mrg(int i, int j) {
	return p[i] > p[j] ? i : j;
}

int Tmax[2 * OFF];

ll query(int i, int a, int b, int lo, int hi) {
	refresh(i, b - a + 1);
	if(lo <= a && b <= hi) return T[i];
	if(a > hi || b < lo) return 0;
	return query(2 * i, a, (a + b) / 2, lo, hi) + 
		   query(2 * i + 1, (a + b) / 2 + 1, b, lo, hi);
}

int get_max(int i, int a, int b, int lo, int hi) {
	if(lo <= a && b <= hi) return Tmax[i];
	if(a > hi || b < lo) return n;
	return mrg(get_max(2 * i, a, (a + b) / 2, lo, hi), get_max(2 * i + 1, (a + b) / 2 + 1, b, lo, hi));
}


ll l_dis[N], r_dis[N], ans[N];

void dfs(int l, int r, ll ohl, ll ohr) {
	if(r < l) return;
	int mid = get_max(1, 0, OFF - 1, l, r);
	ans[mid] = l_dis[mid] + r_dis[mid] + ohl + ohr;
	dfs(mid + 1, r, ohl + r_dis[mid] + (mid - l + 1), ohr);
	dfs(l, mid - 1, ohl, ohr + (r - mid + 1) + l_dis[mid]);
}

void solve(int l, int r){
	if(r < l) return;
	int mid = get_max(1, 0, OFF - 1, l, r);
	solve(l, mid - 1); solve(mid + 1, r);	
	T = Lmax, prop = Lprop;
	l_dis[mid] = query(1, 0, OFF - 1, mid + 1, r);
	update(1, 0, OFF - 1, mid, r, 1);

	T = Rmax, prop = Rprop;
	r_dis[mid] = query(1, 0, OFF - 1, l, mid - 1);
	update(1, 0, OFF - 1, l, mid, 1);	
}

int main(){
	scanf("%d", &n);
	for(int i = 0;i < n;i++) scanf("%d", p + i), Tmax[OFF + i] = i;
	for(int i = OFF - 1; i ; i--) Tmax[i] = mrg(Tmax[2 * i], Tmax[2 * i + 1]);
	solve(0, n - 1); 
	dfs(0, n - 1, 0, 0);
	for(int i = 0;i < n;i++) printf("%lld ", ans[i]);
	printf("\n"); 
	return 0;
}