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
#include <bits/stdc++.h> 

using namespace std;

typedef long long ll;

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

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

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

    ll res[n + 1];
    for (int i = 1; i <= n; i++) {
        res[i] = 0;
        int d[n + 1];
        bool visited[n + 1];
        for (int j = 1; j <= n; j++) {
            d[j] = 1e9;
            visited[j] = 0;
        }

        d[i] = 0;
        queue<int> Q;
        Q.push(i);
        visited[i] = 1;
        while (!Q.empty()) {
            int u = Q.front();
            Q.pop();
            for (int j = 0; j < adj[u].size(); j++) {
                d[adj[u][j]] = min(d[adj[u][j]], d[u] + 1);
                if (!visited[adj[u][j]]) {
                    visited[adj[u][j]] = 1;
                    Q.push(adj[u][j]);
                }
            }
        }
        
        for (int j = 1; j <= n; j++) {
            if (d[j] > n) {
                d[j] = 0;
            }
            res[i] += d[j];
        }
    }

    for (int i = 1; i <= n; i++) {
        cout << res[i] << " ";
    }
    cout << "\n";
    
    return 0;
}