最长递增子序列 ( LIS )——The All-purpose Zero ( HDU 5773 ) ( 2016 Multi-University Training Contest 4 1010 )

int DP[Maxn];
int LIS(int arr[],int n)//arr为数列，n为数列长度，数列从0开始。
{
memset(DP, 0, sizeof(DP));
int i,top,mid,low,high;
top = 0;
DP[0] = -1;
for(i=0;i<n;i++)
{
if(arr[i]>DP[top])
DP[++top] = arr[i];
else
{
low = 1;
high = top;
while(low <= high)
{
mid = (low + high)/2;
if(arr[i] > DP[mid])
low = mid + 1;
else
high = mid - 1;
}
DP[low] = arr[i];
}
}
return top;
}

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#define Maxn 112345
using namespace std;
int N;
int a[Maxn];
int DP[Maxn];
int LIS(int arr[],int n)
{
memset(DP, 0, sizeof(DP));
int i,top,mid,low,high;
top = 0;
DP[0] = -1;
for(i=0;i<n;i++)
{
if(arr[i]>DP[top])
DP[++top] = arr[i];
else
{
low = 1;
high = top;
while(low <= high)
{
mid = (low + high)/2;
if(arr[i] > DP[mid])
low = mid + 1;
else
high = mid - 1;
}
DP[low] = arr[i];
}
}
return top;
}
int main()
{
int T;
scanf("%d", &T);
int ii =1;
while(T--)
{
memset(a, 0, sizeof(a));
scanf("%d", &N);
int Zero = 0;
int index = 0;
for(int i=0; i<N;i++)
{
int x;
scanf("%d", &x);
if(x)  a[index++] = x - Zero;
else Zero++;
}
//cout << LIS(a,index) <<endl;
printf("Case #%d: %d\n", ii++, LIS(a,index)+Zero );
}
return 0;
}