HDU 5773：The All-purpose Zero（贪心+LIS）

http://acm.hdu.edu.cn/showproblem.php?pid=5773

The All-purpose Zero

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.

 

题意：在一个序列里面求最长严格上升子序列，其中0可以任意变换为其他数。

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <iostream>
 using namespace std;
 #define N 100005

 int dp[N];
 int num[N];
 /*
 0可以转化成任意整数，包括负数，
 显然求LIS时尽量把0都放进去必定是正确的。
 因此我们可以把0拿出来，对剩下的做O(nlogn)的LIS，
 统计结果的时候再算上0的数量。为了保证严格递增，
 我们可以将每个权值S[i]减去i前面0的个数，再做LIS，
 就能保证结果是严格递增的。
 */
 int main()
 {
     int t;
     scanf("%d", &t);
     for(int cas = ; cas <= t; cas++) {
         int n;
         scanf("%d", &n);
         int cnt = ;
         int zero = ;
         for(int i = ; i <= n; i++){
             int a;
             scanf("%d", &a);
             if(a == ) zero++;
             else {
                 num[++cnt] = a - zero;
             }
         }
         if(cnt == ) {
             printf("Case #%d: %d\n", cas, n);
             continue;
         }
         memset(dp, , sizeof(dp));
         int tot = ;
         dp[] = num[];
         for(int i = ; i <= cnt; i++) {
             if(num[i] > dp[tot]) dp[++tot] = num[i];
             else {
                 int pos = lower_bound(dp + , dp + tot, num[i]) - dp;
                 dp[pos] = num[i];
             }
         }
         printf("Case #%d: %d\n", cas, tot + zero);
     }
     return ;
 }