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 #include using namespace std; using LL=long long; #define FOR(i,l,r) for(int i=(l);i<=(r);++i) #define REP(i,n) FOR(i,0,(n)-1) #define ssize(x) int(x.size()) templateauto&operator<<(ostream&o,pairp){return o<<'('<auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<sync_with_stdio(0); int n; cin >> n; vector p(n); REP(i, n) { cin >> p[i]; --p[i]; } const int INF = n; vector dist(n, vector(n, INF)); REP(i, n) dist[i][i] = 0; REP(i, n) { REP(j, i) { if (p[i] < p[j]) { dist[i][j] = 1; } } } REP(k, n) { REP(i, k) { REP(j, i) { dist[i][j] = min(dist[i][j], dist[k][i] + dist[k][j]); } } FOR(i, k + 1, n - 1) { REP(j, k) { dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); } FOR(j, k + 1, i - 1) { dist[i][j] = min(dist[i][j], dist[i][k] + dist[j][k]); } } } REP(i, n) { REP(j, i) { if (dist[i][j] == INF) { dist[i][j] = 0; } dist[j][i] = dist[i][j]; } } REP(i, n) { int ans = 0; REP(j, n) { if (dist[i][j] == INF) { dist[i][j] = 0; } ans += dist[i][j]; } cout << ans << ' '; } cout << '\n'; }