hdu 5773 The All-purpose Zero

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=100005;
const int inf=0x3f3f3f3f;
int kase, n, cnt;
int sum[maxn], a[maxn], num[maxn], dp[maxn];
void print() {
for (int i=0; i<n; i++)
printf("%d%c", sum[i], i==n-1?'\n':' ');
}
void print2() {
for (int i=0; i<cnt; i++)
printf("%d%c", num[i], i==cnt-1?'\n':' ');
}
int main()
{
//freopen("in.txt", "r", stdin);
scanf("%d", &kase);
for (int cas=1; cas<=kase; cas++) {
memset(sum, 0, sizeof(sum));
scanf("%d", &n);
for (int i=0; i<n; i++)
scanf("%d", &a[i]);
for (int i=0; i<n; i++)
if (a[i]==0)
sum[i]=1;
for (int i=1; i<n; i++)
sum[i]+=sum[i-1];
cnt=0;
for (int i=0; i<n; i++)
if (a[i]!=0)
num[cnt++]=a[i]-sum[i];
memset(dp, 0x3f, sizeof(dp));
for (int i=0; i<cnt; i++)
*lower_bound(dp, dp+n, num[i])=num[i];
printf("Case #%d: %d\n", cas, sum[n-1]+(int)(lower_bound(dp, dp+n, inf)-dp));
}
return 0;
}