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

int n;
vector <int> p, visited, dist;
int c=0;
queue <int> q;

inline void bfs(int start)
{
	visited[start]=c;
	dist[start]=0;
	
	q=queue <int>();
	q.push(start);

	while(!q.empty())
	{
		int x=q.front();
		int d=dist[x]+1;
		q.pop();
		
		for(int i=0; i<x; ++i)
		{
			if(visited[i]!=c && p[i]>p[x])
			{
				visited[i]=c;
				dist[i]=d;
				q.push(i);
			}
		}
		
		for(int i=x+1; i<n; ++i)
		{
			if(visited[i]!=c && p[i]<p[x])
			{
				visited[i]=c;
				dist[i]=d;
				q.push(i);
			}
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin>>n;
	
	p.resize(n);
	visited.resize(n);
	dist.resize(n);
	
	for(int i=0; i<n; ++i)
		cin>>p[i];
	
	for(int i=0; i<n; ++i)
	{
		++c;
		bfs(i);
		
		int ans=0;
		for(int j=0; j<n; ++j)
			if(visited[j]==c)
				ans+=dist[j];
		cout<<ans<<" ";
	}
	cout<<"\n";
	return 0;
}