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
78
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <stack>
#include <queue>

using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define MP make_pair
#define FOR(v,p,k) for(int v=(p);v<=(k);++v)
#define FORD(v,p,k) for(int v=(p);v>=(k);--v)
#define REP(i,n) for(int i=0;i<(n);++i)
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)x.size()
#define ALL(c) c.begin(),c.end()

#define ODD(x) ((x)%2)
#define EVEN(x) (!(ODD(x)))

int main() {
    int n;
    scanf("%d\n", &n);
    VI p(n);
    REP(i, n) scanf("%d", &p[i]);
    vector<VI> graph(n);

    REP(i, n) FOR(j, i+1, n-1) {
        if (p[i] > p[j]) {
            graph[i].PB(j);
            graph[j].PB(i);
        }
    }

    vector<VI> res(n, vector<int>(n));
    queue<pair<int, int>> q; // node id, dist from source node
    vector<bool> vis(n);
    REP(i, n) {
        q.push(MP(i, 0));
        vis[i] = true;
        while (!q.empty()) {
            auto curr = q.front();
            int node = curr.ST;
            int d = curr.ND;
            q.pop();
            res[i][node] = d;
            res[node][i] = d;
            FOREACH(next, graph[node]) {
                if (!vis[*next]) {
                    q.push(MP(*next, d+1));
                    vis[*next]=true;
                }
            }
        }
        fill(ALL(vis), false);
    }

    REP(i, n) {
        LL res_row = 0;
        REP(j, n) res_row += res[i][j];
        printf("%lld%c", res_row, (i < n-1) ? ' ' : '\n');
    }
    return 0;
}