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<cstdio>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<unordered_map>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef vector<LL> VLL;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int n;
    cin >> n;
    VI p(n);
    REP(i, n) {
        cin >> p[i];
        p[i]--;
    }
    vector<VI> graph(n);
    REP(i, n) {
        FOR(j, i + 1, n - 1) {
            int a = max(i, p[i]);
            if (p[j] < a) {
                graph[i].PB(j);
                graph[j].PB(i);
            }
        }
    }
    vector<bool> visited(n);
    REP(i, n) {
        LL ans = 0;
        queue<PII> q;
        q.push({i, 0});
        visited.assign(n, false);
        visited[i] = true;
        while (!q.empty()) {
            PII x = q.front();
            q.pop();
            ans += x.ND;
            int dist = x.ND + 1;
            for (int v : graph[x.ST]) if (!visited[v]) {
                visited[v] = true;
                q.push({v, dist});
            }
        }
        cout << ans << ' ';
    }
    cout << '\n';
    return 0;
}