1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

template<typename _T> inline void _DBG(const char *s, _T x) { cerr << s << " = " << x << "\n"; }
template<typename _T, typename... args> void _DBG(const char *s, _T x, args... a) { while(*s != ',') cerr << *s++; cerr << " = " << x << ','; _DBG(s + 1, a...); }

#ifdef LOCAL
#define _upgrade ios_base::sync_with_stdio(0);
#define DBG(...) _DBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define _upgrade ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define DBG(...) (__VA_ARGS__)
#define cerr if(0) cout
#endif

// ********************** CODE ********************** //

const int N = 2e5 + 7;

int n, P[N];
vector<int> G[N];

int dist[N];
queue<int> Q;

void BFS(int s, LL &ans)
{
    Q.push(s);
    while (!Q.empty())
    {
        int v = Q.front();
        Q.pop();
        for (auto u: G[v])
        {
            if (dist[u] == N)
            {
                dist[u] = dist[v] + 1;
                ans += dist[u];
                Q.push(u);
            }
        }
    }
}

int main()
{
    _upgrade
    
    cin >> n;
    set<pair<int, int>> S;
    for (int i = 1; i <= n; i++)
    {
        cin >> P[i];
        auto it = S.lower_bound({P[i], 0});
        while (it != S.end())
        {
            int j = it->second;
            G[i].push_back(j);
            G[j].push_back(i);
            it++;
        }
        S.insert({P[i], i});
    }

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
            dist[j] = N;
        dist[i] = 0;
        LL ans = 0;
        BFS(i, ans);
        cout << ans << " ";
    }
    cout << "\n";

    return 0;
}