#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
template <typename T>
struct Fenwick {
    int n;
    std::vector<T> a;
    
    Fenwick(int n_ = 0) {
        init(n_);
    }
    
    void init(int n_) {
        n = n_;
        a.assign(n, T{});
    }
    
    void add(int x, const T &v) {
        for (int i = x + 1; i <= n; i += i & -i) {
            a[i - 1] = a[i - 1] + v;
        }
    }
    
    T sum(int x) {
        T ans{};
        for (int i = x; i > 0; i -= i & -i) {
            ans = ans + a[i - 1];
        }
        return ans;
    }
    
    T rangeSum(int l, int r) {
        return sum(r) - sum(l);
    }
    
    int select(const T &k) {
        int x = 0;
        T cur{};
        for (int i = 1 << std::__lg(n); i; i /= 2) {
            if (x + i <= n && cur + a[x + i - 1] <= k) {
                x += i;
                cur = cur + a[x - 1];
            }
        }
        return x;
    }
};

void solve() {
    int n;
    std::cin >> n;
    
    std::vector<int> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        a[i]--;
    }
    
    std::vector<int> l(n), r(n);
    for (int i = 0; i < n; i++) {
        l[i] = (i > 0 && a[i] == a[i - 1] ? l[i - 1] : 0) + 1;
    }
    for (int i = n - 1; i >= 0; i--) {
        r[i] = (i + 1 < n && a[i] == a[i + 1] ? r[i + 1] : 0) + 1;
    }
    
    std::vector<std::vector<std::array<int, 3>>> e(n);
    for (int i = 0; i < n; i++) {
        e[a[i]].push_back({l[i], i, 0});
        e[a[i]].push_back({r[i], i, 1});
    }
    
    std::vector<i64> ans(n / 2 + 1);
    
    Fenwick<int> fenl(n);
    Fenwick<int> fenr(n);
    for (int x = 0; x < n; x++) {
        std::sort(e[x].begin(), e[x].end(), std::greater());
        for (auto [v, i, t] : e[x]) {
            if (t == 0) {
                int res = fenr.rangeSum(i + 1, n);
                if (res > 0) {
                    ans[v] += res;
                }
                fenl.add(i, 1);
            } else {
                int res = fenl.sum(i);
                if (res > 0) {
                    ans[v] += res;
                }
                fenr.add(i, 1);
            }
        }
        for (auto [v, i, t] : e[x]) {
            if (t == 0) {
                fenl.add(i, -1);
            } else {
                fenr.add(i, -1);
            }
        }
    }
    for (int i = n / 2 - 1; i >= 1; i--) {
        ans[i] += ans[i + 1];
    }
    for (int i = 1; i <= n / 2; i++) {
        std::cout << ans[i] << " \n"[i == n / 2];
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}