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
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, l, r) for (auto i = (l); i <= (r); ++i)
#define REP(i, n) FOR (i, 0, (n)-1)
#define ssize(x) int(x.size())
template<class A, class B>
auto&
operator<<(ostream& o, pair<A, B> p)
{
  return o << "(" << p.first << ", " << p.second << ")";
}
template<class T>
auto
operator<<(ostream& o, T x) -> decltype(x.end(), o)
{
  o << "{";
  int i = 0;
  for (auto e : x) o << (", ") + 2 * !i++ << e;
  return o << "}";
}
#ifdef DEBUG
#define debug(x...)                                                            \
  cerr << "[" #x "]: ", [](auto... $) { ((cerr << $ << "; "), ...); }(x),      \
    cerr << '\n'
#else
#define debug(...)                                                             \
  {                                                                            \
  }
#endif

// Global variables
int nverts;
vector<vector<int>> adj;

void input();

int
main()
{
  cin.tie(0)->sync_with_stdio(0);
  input();

  FOR(start, 1, nverts)
  {
    int sum = 0;
    deque<pair<int, int>> q({{start, 0}});
    vector<bool> visited(nverts + 1);
    visited[start] = true;
    while(!q.empty())
    {
      auto v = q.back();
      q.pop_back();
      for (auto neigh : adj[v.first])
        if (!visited[neigh])
        {
          sum += v.second + 1;
          visited[neigh] = true;
          q.push_front({neigh, v.second + 1});
        }
    }
    cout << sum << " ";
  }
  cout << "\n";

  return 0;
}

void
input()
{
  cin >> nverts;
  vector<int> X2(nverts + 1);  // X2 of given X1
  adj.resize(nverts + 1);
  FOR (X1, 1, nverts)
    cin >> X2[X1];

  // Construct the graph
  FOR (v, 1, nverts)
    FOR (neigh, v + 1, nverts)
      if (X2[neigh] < X2[v])
      {
        adj[v].push_back(neigh);
        adj[neigh].push_back(v);
      }
}