Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 131072/131072 K (Java/Others)
$ZYB$ has a premutation $P$,but he only remeber the reverse log of each prefix of the premutation,now he ask you to
restore the premutation.
Pair $(i,j)(i < j)$ is considered as a reverse log if $A_i>A_j$ is matched.
In the first line there is the number of testcases T.
For each teatcase:
In the first line there is one number $N$.
In the next line there are $N$ numbers $A_i$,describe the number of the reverse logs of each prefix,
The input is correct.
$1 \leq T \leq 5$,$1 \leq N \leq 50000$
For each testcase,print the ans.
BestCoder Round #65