当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5773：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.
来自杭电HDUOJ的附加信息
Author FZU
Recommend wange2014
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2016 Multi-University Training Contest 4
源链接： HDU-5773
最后修改于 2020-10-25T23:25:31+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)