The All-purpose Zero

?? gets an sequence S with n intergers(0 < n <= 100000,0<= S[i] <= 1000000).?? has a magic so that he can change 0 to any interger(He does not need to change all 0 to the same interger).?? wants you to help him to find out the length of the longest increasing (strictly) subsequence he can get.

The first line contains an interger T,denoting the number of the test cases.(T <= 10)
For each case,the first line contains an interger n,which is the length of the array s.
The next line contains n intergers separated by a single space, denote each number in S.

For each test case, output one line containing “Case #x: y”(without quotes), where x is the test case number(starting from 1) and y is the length of the longest increasing subsequence he can get.

2
7
2 0 2 1 2 0 5
6
1 2 3 3 0 0

Case #1: 5
Case #2: 5

In the first case,you can change the second 0 to 3.So the longest increasing subsequence is 0 1 2 3 5.

FZU

2016 Multi-University Training Contest 4