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;
using ll = long long;

#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) ;
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, n, m) for (int i = (n); i < (m); ++i)

#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define reppr(i, n, m) for (int i = (m) - 1; i >= (n); --i)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;

template <typename T, typename V> void mini(T& a, V b) {if (b < a) a = b; }
template <typename T, typename V> void maxi(T& a, V b) {if (b > a) a = b; }

const int INF = 1e9;

void solve() {
    int n;
    cin >> n;

    vi perm(n);
    for (int &i : perm) {cin >> i; --i; }

    vvi d(n, vi(n, INF));
    // vvi G(n);

    rep(j, n) rep(i, j) if (perm[i] > perm[j]) {
        // G[i].push_back(j);
        // G[j].push_back(i);

        d[i][j] = d[j][i] = 1;
    }

    rep(i, n) d[i][i] = 0;

    rep(i, n) rep(j, n) rep(k, n)
        mini(d[j][k], d[j][i] + d[i][k]);

    rep(i, n) rep(j, n) if (d[i][j] == INF) d[i][j] = 0;

    rep(i, n) cout << accumulate(all(d[i]), ll(0)) << ' ';
    cout << '\n';

    rep(i,n) debug(i, d[i]);
}

int main() {
#ifndef DEBUG
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int z = 1;
    // scanf("%d", &z);
    while (z--)
        solve();
    return 0;
}