HDOJ 5773 The All-purpose Zero(LIS)

The All-purpose Zero

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1012    Accepted Submission(s): 485

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.

 

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: 5


   
   

    
    

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

 

题意：给出一个n个数字的数列，数列中零可以变成任意数，也可以是负数，问最长上升子序列的长度是多少？

题解：求LIS的最大长度时一定要把所有的零放进去，例如3 0 4 这种情况可以把变为 3 4 4，最优解长度依然是2。

对于 L 0 R(R>L+1)这种情况0就可以变成中间任意的数了。 我们只需要把s[i]减去i之前0的个数，忽略零求出LIS的长度，最后加上0的个数即可。

代码如下:

#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 100010
#define INF 0x3f3f3f
using namespace std;
int a[maxn],dp[maxn];
int main()
{
	int t,n,i,num,cs=1;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=0;i<n;++i)
			scanf("%d",&a[i]);
		num=0;
		int ans=0,k=0;
		for(i=0;i<n;++i)
		{
			if(a[i]==0)
			{
				num++;
				continue;
			}
			a[i]-=num;
			a[k++]=a[i];
		}
		fill(dp,dp+n,INF);
		for(i=0;i<k;++i)
			*lower_bound(dp,dp+k,a[i])=a[i];
		printf("Case #%d: %d\n",cs++,lower_bound(dp,dp+n,INF)-dp+num);
	}
	return 0;
}