#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
  int x = 0; bool op = 0;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 3e5 + 10;
int n;
int p[N], sz[N], st[N][25], one[N];
ll f[N], d[N];
int cmax(int x, int y) {return p[x] > p[y] ? x : y;}
void build() {
  for(int i = 1; i <= n; i++)st[i][0] = i;
  for(int j = 1; (1 << j) <= n; j++)
    for(int i = 1; i + (1 << j) - 1 <= n; i++)
      st[i][j] = cmax(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
  return ;
}
int query(int l, int r) {
  int t = __lg(r - l + 1);
  return cmax(st[l][t], st[r - (1 << t) + 1][t]);
}
int solve(int l, int r) {
  int k = query(l, r), ls = 0, rs = 0;
  if(l < k)ls = solve(l, k - 1);
  if(k < r)rs = solve(k + 1, r);
  auto add = [&](int l, int r, int w) {d[l] += w; d[r + 1] -= w;};
  sz[k]++; f[k] = f[ls] + f[rs] + sz[k];
  add(l, k - 1, f[rs] + r - k + 1);
  add(k + 1, r, f[ls] + k - l + 1);
  add(k, k, f[ls] + f[rs] + (r - l - one[k]));
  sz[cmax(l - 1, r + 1)] += sz[k];
  one[l - 1] += sz[k]; one[r + 1] += sz[k];
  // printf("%d %d %d %d %d\n", k, l, r, sz[k], one[k]);
  return k;
}
int main() { 
  n = read();
  for(int i = 1; i <= n; i++)p[i] = read();
  build(); solve(1, n);
  for(int i = 1; i <= n; i++)d[i] += d[i - 1];
  for(int i = 1; i <= n; i++)printf("%lld ", d[i]); putchar('\n');
  return 0;
}