5592：ZYB's Premutation

题目描述

$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.

输入样例

1
3
0 1 2

输出样例

3 1 2

来自杭电HDUOJ的附加信息

Recommend

hujie

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 BestCoder Round #65

源链接： HDU-5592

最后修改于 2020-10-25T23:24:02+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
2000/1000MS(Java/Others)	131072/131072K(Java/Others)