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
//2022-12-18
//author: Marcin Rolbiecki
#include <bits/stdc++.h>
using namespace std;

const int maxN = 2e5+10;

int n;
int P[maxN];
vector <vector <int>> G (maxN);

int odl [maxN];

void bfs (int x) {
	
	queue <int> Q;
	Q.push(x);
	
	while (!Q.empty()) {
		
		int t = Q.front();
		Q.pop();
		
		for (int u : G[t])
			if (u != x && odl[u] == 0) {
				odl[u] = odl[t] + 1;
				Q.push(u);
			} 
	}
}

int main () {
		
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	
	for (int i = 1; i <= n; i++)
		cin >> P[i];
		
	for (int i = 1; i <= n; i++)
		for (int j = i+1; j <= n; j++)
			if (P[i] > P[j]) {
				G[i].push_back(j);
				G[j].push_back(i);
			}
	
	for (int i = 1; i <= n; i++) {
		
		fill (odl, odl + n + 1, 0);
		bfs(i);
		
		int sum = 0;
		for (int j = 1; j <= n; j++)
			sum += odl[j];
			
		cout << sum << ' ';
	}
	
	
	return 0;
}