poj 1887 Testing the CATCHER 最长不升子序列

#include <cstdio>
#include <cstdlib>
#include <climits>
#include <cstring>

const int maxx = 100001;
int num[maxx],dp[maxx];

void max(int &a,int b){
	if(a<b)a = b;
}

int main(){

	int pos = 0,nu,i,j,cas=0;

	while(scanf("%d",&nu)){
		if(nu!=-1){
			dp[pos] = 1;
			num[pos++] = nu;
			continue;
		}
		if(nu==-1 && pos==0){
			break;
		}

		++cas;

		for(i=0;i<pos;++i){
			for(j=0;j<i;++j){
				if(num[i]<=num[j]){
					max(dp[i],dp[j]+1);
				}
			}
		}

		int maxx = -1;
		for(i=0;i<pos;++i)if(dp[i]>maxx)maxx = dp[i];
		printf("Test #%d:\n",cas);
		printf("  maximum possible interceptions: %d\n\n",maxx);
		pos = 0;
	}
	return 0;
}