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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/* -----------------------
Autor: Tomasz Boguslawski
-------------------------- */
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<iomanip>
#include<string>
#include<sstream>
#include<cstring>
#include<map>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include <fstream>
#include<math.h>

#define LL long long
#define FOR(x, b, e) for(LL x = b; x <= (e); x++)
#define FORS(x, b, e, s) for(LL x = b; x <= (e); x+=s)
#define FORD(x, b, e) for(LL x = b; x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG if (debug)
#define MIN(a,b) ((a>b)?b:a)
#define MAX(a,b) ((a>b)?a:b)

using namespace std;

LL n;
LL dokad[201000];

LL roundNo;
LL was[201000];

vector<LL> edges[201000];

LL rozplyw(LL startNode)
{
    roundNo++;
    was[startNode]=roundNo;
    vector<LL> next;
    next.push_back(startNode);
    LL distance=0;
    LL total=0;
    while (next.size()>0)
    {
        distance++;
        vector<LL> current(next);
        next.clear();
        FOREACH(ep,current)
        {
            LL node=*ep;
            FOREACH(np,edges[node]) if (was[*np]!=roundNo)
            {
                was[*np]=roundNo;
                next.push_back(*np);
                total+=distance;
            }
        }
    }
    return total;
}

/// MAIN
int main(int argc, char* argv[])
{
    // magic formula, which makes streams work faster:
	ios_base::sync_with_stdio(0);

    cin >> n;
    FOR(i,1,n) cin >> dokad[i];
    roundNo=1;
    FOR(i,1,n)
    {
        was[i]=0;
        FOR(j,1,i-1) if (dokad[j]>dokad[i])
        {
            edges[i].push_back(j);
            edges[j].push_back(i);
        }
    }

    FOR(i,1,n) cout << rozplyw(i) << " ";
    cout << "\n";

	return 0;
}