【杭电oj5773】The All-purpose Zero

                               The All-purpose Zero

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

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.
   
   
   
    
  
  

 

Author

FZU

 

Source

2016 Multi-University Training Contest 4

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5831  5830  5829  5828  5827 

 思路：0的个数加上非0的序列的最长上升子序列的长度，这样就被坑了，还要注意可能某个区间0的个数特别多以致于此区间内的一部分0是用不上的，所以就有了我代码的注释。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int N = 100005;
const int INF = 1<<30;
int a[N],b[N];
int find(int l,int r,int x) {
	while(l<=r) {
		int mid=l+r>>1;
		if(b[mid]<x) l=mid+1;
		else if(b[mid]>x) r=mid-1;
		else {
			l=mid;
			break;
		}
		//printf("---\n");
	}
	return l;
}
int main() {
	int T,p=0,n,t;
	scanf("%d",&T);
	while(T--) {
		int cnt=0,temp=0;
		scanf("%d",&n);
		for(int i=0; i<n; i++) {
			scanf("%d",&t);
			if(!t) temp++;
			else a[cnt++]=t-temp;    //因为此处的马虎，错的我怀疑人生，你看测试的地方辣莫多
									//通过减去之前出现的0的个数确定原序列的升序改变 
			//	printf("%d--\n",cnt);
		}
		if(!cnt) {
			printf("Case #%d: %d\n",++p,temp);
			continue;
		}
		int len=0;
		b[0]=-INF;
		for(int i=0; i<cnt; i++) {
			//	printf("%d--\n",a[i]);
			if(a[i]>b[len])
				b[++len]=a[i];
			else {
				int j=find(1,len,a[i]);
				b[j]=a[i];
			}
			//	printf("%d---\n",len);
		}
		printf("Case #%d: %d\n",++p,len+temp);
	}
	return 0;
}

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=5773