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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <bits/stdc++.h> //Michał Kuśmirek
using namespace std;     //XIII LO Szczecin

#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)

template<class T> int size(T && a) {
	return (int)(a.size());
}
ostream& operator << (ostream &os, string str) {
    for(char c : str) os << c;
    return os;
}
template <class A, class B> ostream& operator << (ostream &os, const pair<A, B> &p) {
	return os << '(' << p.first << "," << p.second << ')';
}
template <class T> auto operator << (ostream &os, T &&x) -> decltype(x.begin(), os) {
	os << '{';
	for(auto it = x.begin(); it != x.end(); ++it)
		os << *it << (it == prev(x.end()) ? "" : " ");
	return os << '}';
}
template <class T> ostream& operator << (ostream &os, vector<vector<T>> vec) {
    for(auto x : vec)
    	os << "\n  " << x;
    return os;
}
void dump() {}
template <class T, class... Args> void dump(T &&x, Args... args) {
    cerr << x << "; ";
    dump(args...);
}
#ifdef DEBUG
# define debug(x...) cerr << "[" #x "]: ", dump(x), cerr << '\n'
#else 
# define debug(...) 0
#endif

//--------------------------------------------------

const int INF = int(1e9);
vector<vector<int>> graph;

vector<int> BFS(int source) {
	int n = size(graph);

	queue<int> Q;
	Q.push(source);

	vector<int> dist(n, 0);
	dist[source] = 0;

	while(!Q.empty()) {
		int v = Q.front();
		Q.pop();

		for(int u : graph[v]) if(dist[u] == 0 and u != source){
			dist[u] = dist[v] + 1;
			Q.push(u);
		}
	}

	return dist;
}

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

	int n; cin >> n;
	vector<int> p(n);
	REP(i, n) {
		cin >> p[i];
		--p[i];
	}


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

	REP(v, n) {
		vector<int> dist = BFS(v);
		debug(v, dist);
		int answer = 0;
		for(int x : dist)
			answer += x;
		cout << answer << ' ';
	}
	cout << '\n';
}