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
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef pair<int,int> pii;
const ll INFLL=1e18+7;
const int INF=1e9+7;
#define pb push_back
const int MAXN=2e5+7;
int arr[MAXN];
vector<int> G[MAXN];
int dist[MAXN];
ll res[MAXN];
int main()
{
	ios_base::sync_with_stdio(0);
	int n; cin>>n;
	for(int i=1;i<=n;++i) cin>>arr[i];
	for(int i=1;i<=n;++i){
		for(int j=1;j<i;++j){
			if(arr[j]>arr[i]) G[i].pb(j);
		}
		for(int j=i+1;j<=n;++j){
			if(arr[j]<arr[i]) G[i].pb(j);
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j) dist[j]=INF;
		dist[i]=0;
		queue<int> Q;
		Q.push(i);
		while(!Q.empty()){
			int vert=Q.front(); Q.pop();
			for(int &v:G[vert]){
				if(dist[v]>dist[vert]+1){
					dist[v]=dist[vert]+1;
					Q.push(v);
				}
			}
		}
		for(int j=1;j<=n;++j) if(dist[j]<INF) res[i]+=dist[j];
	}
	for(int i=1;i<=n;++i) cout<<res[i]<<" ";
	cout<<"\n";
}