The All-purpose Zero
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1440 Accepted Submission(s): 686
Problem Description
?? 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.
Input
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 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.
Output
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.
Sample Input
2 7 2 0 2 1 2 0 5 6 1 2 3 3 0 0
Sample Output
Case #1: 5 Case #2: 5HintIn the first case,you can change the second 0 to 3.So the longest increasing subsequence is 0 1 2 3 5.
Author
FZU
Source
/* ***********************************************
Author : ryc
Created Time : 2016-08-03 Wednesday
File Name : E:\acmcode\hdoj\5773.cpp
LANGUAGE : c++
Copyright 2016 ryc All Rights Reserved
************************************************ */
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<list>
#include<map>
using namespace std;
const int maxn=1000010;
int num[maxn];
int s[maxn];
int LIS(int n){
if(n==0)return 0;
num[1]=s[1];int len=1;
for(int i=2;i<=n;++i){
if(s[i]>num[len]){
num[++len]=s[i];
continue;
}
int left=1,right=len;
while(left<=right){
int mid=(left+right)>>1;
if(s[i]>num[mid]){
left=mid+1;
}
else {
right=mid-1;
}
}
num[left]=s[i];
}
return len;
}
int main()
{
int t,T=1,n;cin>>t;
while(t--){
scanf("%d",&n);
int ans=0,cnt=0;
for(int i=1;i<=n;++i){
scanf("%d",&num[i]);
if(num[i]==0)ans++;
else {
s[++cnt]=num[i]-ans;
}
}
ans+=LIS(cnt);
printf("Case #%d: %d\n",T++,ans);
}
return 0;
}