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
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int n, p[MAXN], vis[MAXN], dist[MAXN];
vector<int> g[MAXN];
int32_t main() {
    ios_base::sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            // Jak liny sie przecinaja to jest krawędź.
            if ((i < j) ^ (p[i] < p[j])) {
                // cerr << i << " " << j << "\n";
                g[i].push_back(j);
                g[j].push_back(i);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        queue<int> q;
        q.push(i);
        vis[i] = i;
        while (!q.empty()) {
            int v = q.front();
            while (!q.empty()) {
                int v = q.front();
                q.pop();
                for (auto u : g[v]) {
                    if (vis[u] != i) {
                        dist[u] = dist[v] + 1;
                        vis[u] = i;
                        q.push(u);
                    }
                }
            }
        }

        long long res = 0;
        for (int j = 1; j <= n; j++) {
            res += dist[j];
            dist[j] = 0;
        }
        // cout << "\n";

        cout << res << " ";
    }
    cout << "\n";
}