UVA11525 Permutation 逆康托展开

传送门

题意：

思路：

逆康托展开板子

// Problem: UVA11525 Permutation
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/UVA11525
// Memory Limit: 0 MB
// Time Limit: 3000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#include<random>
#include<cassert>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define pb push_back
#define mk make_pair
#define Mid ((tr[u].l+tr[u].r)>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define db puts("---")
using namespace std;

//void rd_cre() { freopen("d://dp//data.txt","w",stdout); srand(time(NULL)); }
//void rd_ac() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//AC.txt","w",stdout); }
//void rd_wa() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//WA.txt","w",stdout); }

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;

const int N=1000010,mod=1e9+7,INF=0x3f3f3f3f;
const double eps=1e-6;

int n;
int a[N];
struct Node {
	int l,r;
	int cnt;
}tr[N<<2];

void pushup(int u) {
	tr[u].cnt=tr[L].cnt+tr[R].cnt;
}

void build(int u,int l,int r) {
	tr[u]={l,r};
	if(l==r) {
		tr[u].cnt=1;
		return;
	}
	build(L,l,Mid); build(R,Mid+1,r);
	pushup(u);
}

void change(int u,int pos) {
	if(tr[u].l==tr[u].r) {
		tr[u].cnt=0;
		return;
	}
	if(pos<=Mid) change(L,pos);
	else change(R,pos);
	pushup(u);
} 

int query(int u,int cnt) {
	if(tr[u].l==tr[u].r) return tr[u].l;
	if(tr[L].cnt>cnt) return query(L,cnt);
	else return query(R,cnt-tr[L].cnt);
}

int main()
{
//	ios::sync_with_stdio(false);
//	cin.tie(0);
	
	int _; scanf("%d",&_);
	while(_--) {
		scanf("%d",&n);
		for(int i=1;i<=n;i++) scanf("%d",&a[i]);
		build(1,1,n);
		for(int i=1;i<=n;i++) {
			int pos=query(1,a[i]);
			change(1,pos);
			printf("%d%c",pos,i==n? '\n':' ');
		}
	}



	return 0;
}
/*

*/