#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 5;
struct qu{
    int l, r, id;
    friend bool operator < (qu a, qu b) {
        return a.r > b.r;
    }  
} a[N];
int b[N];
void solve() {
    int n; cin >> n;
    
    for(int i = 1, x; i <= n; i++) {
        cin >> x;
        if(x != 0)
            a[i] = qu{(i+x)/(1+x), i/x, i};
        else a[i] = qu{i+1, n, i};
    }
    sort(a + 1, a + n + 1, [](qu a, qu b) {return a.l < b.l;});
    priority_queue<qu> q;
    int p = 1;
    for(int i = 1; i <= n; i++) {
        while(p <= n && a[p].l <= i) 
            q.push(a[p++]);
        // cout << q.top().r << endl;
        b[q.top().id] = i;
        q.pop();
    }
    for(int i = 1; i <= n; i++)
        cout << b[i] << " \n"[i==n];
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t; cin >> t;
    while(t--) solve();

    return 0;
}

1.为什么当 $a_i=0$ 时，区间右端点赋成一个比较大的数就过不了样例？赋值成 $n$ 就可以？

2.求调/kk