---

假如要找出 3 2 1 的第幾順位,
3 前面有 1 2, 故 2*2!, 2 前面還有 1, 故 1*1!, 最後是 0
因此是 2*2! + 1*1! + 0*0! = 5
因此從 1 開始算 3, 3被選出來
... 算 2, 算 1 ...

#include <stdio.h>

int main() {
    int t, k, i, j, s;
    unsigned C[50001];
    scanf("%d", &t);
    while(t--) {
        scanf("%d", &k);
        for(i = 1; i <= k; i++)
            C[i] = 0;
        for(i = 1; i <= k; i++) {
            j = i;
            while(j <= k) {
                C[j]++;
                j += j&(-j);
            }
        }
        int l, r, m, sum1, sum2;
        for(i = 1; i <= k; i++) {
            scanf("%d", &s);
            s++;
            l = 1, r = k;
            if(i != 1)
                putchar(' ');
            while(l <= r) {
                m = (l+r)>>1;
                j = m, sum1 = 0;
                while(j > 0)    sum1 += C[j], j -= j&(-j);

                if(sum1 == s) {
                    j = m-1, sum2 = 0;
                    while(j > 0)    sum2 += C[j], j -= j&(-j);
                    if(sum1 == sum2+1)
                        break;
                    else
                        r = m-1;
                } else if(sum1 > s)
                    r = m-1;
                else
                    l = m+1;
            }
            printf("%d", m);
            j = m;
            while(j <= k) {
                C[j]--;
                j += j&(-j);
            }
        }
        puts("");
    }
    return 0;
}