3564：Another LIS

题目描述

There is a sequence firstly empty. We begin to add number from 1 to N to the sequence, and every time we just add a single number to the sequence at a specific position. Now, we want to know length of the LIS (Longest Increasing Subsequence) after every time's add.

输入解释

An integer T (T <= 10), indicating there are T test cases.
For every test case, an integer N (1 <= N <= 100000) comes first, then there are N numbers, the k-th number Xk means that we add number k at position Xk (0 <= Xk <= k-1).See hint for more details.

输出解释

For the k-th test case, first output "Case #k:" in a separate line, then followed N lines indicating the answer. Output a blank line after every test case.

输入样例

1
3
0 0 2

输出样例

Case #1:
1
1
2

提示

In the sample, we add three numbers to the sequence, and form three sequences.
a. 1
b. 2 1
c. 2 1 3

来自杭电HDUOJ的附加信息

Author	standy
Recommend	zhouzeyong

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

题目来源 2010 ACM-ICPC Multi-University Training Contest（13）——Host by UESTC

源链接： HDU-3564

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

共提交 0 次

通过率 --%

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