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

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

	int n;
	cin >> n;
	vector< vector<int> > G(n);
	vector<int> p(n);
	for (int &i: p) {
		cin >> i;
		i--;
	}

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

	for (int i = 0; i < n; i++) {
		vector<bool> vis(n);
		vector<int> odl(n);
		queue<int> q;
		q.push(i);
		int res = 0;
		vis[i] = true;

		while(!q.empty()) {
			int x = q.front();
			q.pop();

			for (int j : G[x]) {
				if (!vis[j]) {
					odl[j] = odl[x] + 1;
					res += odl[j];
					vis[j] = true;
					q.push(j);
				}
			}
		}

		cout << res << " ";
	}

}