The All-purpose Zero---hdu5773（LIS变形）

#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<stdio.h>
#include<map>
#include<queue>
using namespace std;
#define met(a, b) memset(a, b, sizeof(a))
#define mod 1000000007
typedef long long LL;
//////////////////////////////////////////////////////////////
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;

int a[N], b[N], dp[N], n;

int main()
{
    int T, t = 1;
    scanf("%d", &T);
    while(T--)
    {
        met(a, 0); met(b, 0);

        scanf("%d", &n);
        int m = 0, cnt = 0;

        for(int i=0; i<n; i++)
        {
            scanf("%d", &a[i]);
            if(a[i] == 0) cnt ++;
            else b[m++] = a[i]-cnt;
        }

        met(dp, INF);

        for(int i=0; i<m; i++)
        {
            int pos = lower_bound(dp, dp+m, b[i]) - dp;
            dp[pos] = b[i];
        }
        int ans = lower_bound(dp, dp+m, INF) - dp;

        printf("Case #%d: %d\n", t++, ans+cnt);
    }
    return 0;
}