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
#include "bits/stdc++.h" // Tomasz Nowak
using namespace std;     // University of Warsaw
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())
template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) {
	return o << '(' << p.first << ", " << p.second << ')';
}
template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
	o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}';
}
#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define debug(...) {}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n;
	cin >> n;
	vector<int> p(n);
	for(int &pi : p) {
		cin >> pi;
		--pi;
	}
	debug(n, p);

	vector<vector<int>> graph(n);
	REP(v, n)
		REP(u, n)
			if(bool(v < u) != bool(p[v] < p[u]))
				graph[v].emplace_back(u);
	debug(graph);

	vector<int> ans(n);
	REP(start, n) {
		vector<int> dist(n, -1);
		dist[start] = 0;
		deque<int> que = {start};
		while(not que.empty()) {
			int v = que.front();
			que.pop_front();
			for(int u : graph[v])
				if(dist[u] == -1) {
					dist[u] = dist[v] + 1;
					que.emplace_back(u);
				}
		}
		REP(v, n)
			if(dist[v] != -1)
				ans[start] += dist[v];
	}
	REP(v, n)
		cout << ans[v] << ' ';
	cout << '\n';
}