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
#include <bits/stdc++.h>
using namespace std;
long long dist[200005];
int kraw[200005];
long long INF = 1000000000000000;
vector<int> G[200005];
void bfs(int u)
{
    queue <int> q;
    q.push(u);
    dist[u] = 0;
    while (!q.empty())
    {
        u = q.front();
        q.pop();
        for (int i = 0; i < G[u].size(); i++)
        {
            if (dist[G[u][i]] == INF) {
                dist[G[u][i]] = dist[u] + 1;
                q.push(G[u][i]);
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        kraw[i] = x + n;
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j < i; j++)
        {
            if (kraw[j] > kraw[i])
            {
                G[i].push_back(j);
                G[j].push_back(i);
            }
        }
        for (int j = i + 1; j <= n; j++)
        {
            if (kraw[j] < kraw[i]) 
            {
                G[i].push_back(j);
                G[j].push_back(i);
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            dist[j] = INF;
        }
        bfs(i);
        long long sum = 0;
        for (int j = 1; j <= n; j++)
            if (dist[j] != INF)
                sum += dist[j];
        cout << sum << " ";
    }

    return 0;
}