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
#include <bits/stdc++.h>
#include <random>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long
#define mt make_tuple
    
using namespace std;

const int nax = 3333;
bitset<nax> adj[nax];
int a[nax];
int n;
ll ans[nax];

void bfs(int v){
    bitset<nax> unvisited;
    for(int i=1;i<=n;i++) unvisited[i] = true;
    vector<int> dist(n + 1, n + n);
    vector<int> Q;
    Q.pb(v);
    dist[v] = 0;
    int wsk = 0;
    unvisited[v] = false;
    while(wsk < (int)Q.size()){
        int cur = Q[wsk++];
        while((unvisited & adj[cur]).count()){
            int kto = (unvisited & adj[cur])._Find_first();
            unvisited[kto] = false;
            dist[kto] = dist[cur] + 1;
            ans[v] += dist[kto];
            Q.pb(kto);
        }
    }
}

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) cin >> a[i];
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i == j) continue;
            if((j < i && a[j] > a[i]) || (j > i && a[j] < a[i])) adj[i][j] = true;
        }
    }

    for(int i=1;i<=n;i++) bfs(i);
    for(int i=1;i<=n;i++) cout << ans[i] << " ";
    cout << "\n";
}
    
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    
    int tt = 1;
    // cin >> tt;
    while(tt--) solve();
    
    return 0;
}


/*
g++ -std=c++17 -Wall -Wshadow -Wextra -O2 -fsanitize=address -fsanitize=undefined c.cpp -o c
*/