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
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;
using ll = long long;

const int MAX_N = 200007;

int n;
int p[MAX_N];
vector<int> graph[MAX_N];
ll dist[MAX_N];
bool vis[MAX_N];

void bfs(int src) {
    queue<int> q;
    q.push(src);
    vis[src] = true;
    dist[src] = 0;

    while (!q.empty()) {
        int sz = q.size();

        for (int i = 0; i < sz; i++) {
            int v = q.front();
            q.pop();

            for (int j = 0; j < graph[v].size(); j++) {
                if (!vis[graph[v][j]]) {
                    vis[graph[v][j]] = true;
                    dist[graph[v][j]] = dist[v] + 1;
                    q.push(graph[v][j]);
                }
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n;

    for (int i = 1; i <= n; i++)
        cin >> p[i];

    for (int i = 1; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            if (p[i] > p[j]) {
                graph[i].push_back(j);
                graph[j].push_back(i);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        fill(dist, dist + n + 2, 0);
        fill(vis, vis + n + 2, false);
        bfs(i);

        ll s = 0;

        for (int j = 1; j <= n; j++) {
            s += dist[j];
        }

        cout << s << ' ';
    }

    cout << '\n';

    return 0;
}