Array

    1#include <bits/stdc++.h>
    2using namespace std;
    3using ll = long long;
    4using i128 = __int128;
    5const int inf = 1e9;
    6const ll INF = 1e18; //❄️
    7void solve() {
    8    int n; cin >> n;
    9    vector<int> v(n);
    10    int mx = -1;
    11    for (int i = 0; i < n; i++) {
    12        cin >> v[i];
    13        mx = max(mx, v[i]);
    14    }
    15 
    16    for (int i = 0; i < n; i++) {
    17        ll cnt1 = 0, cnt2 = 0;
    18        for (int j = i + 1; j < n; j++) {
    19            if (abs(v[i] + mx) > abs(v[j] + mx)) cnt1++;
    20        }
    21        for (int j = i + 1; j < n; j++) {
    22            if (abs(v[i] - mx) > abs(v[j] - mx)) cnt2++;
    23        }
    24        cout << max(cnt1, cnt2) << " ";
    25    }
    26    cout << '\n';
    27}
    28int main() {
    29    ios::sync_with_stdio(0); cin.tie(0); 
    30    int t; cin >> t;
    31    while (t--) {
    32        solve();
    33    }
    34    return 0;
    35}