poj 2533 Longest Ordered Subsequence

水水的DP，然后被特判坑了~n==1时输出1.

#include<stdio.h>#include<string.h>int a[50005],b[50005];int main(){int max,lmax,n,m,i,j,k;scanf("%d",&n);memset(b,0,sizeof(b));for(i=1;i<=n;i++)scanf("%d",&a[i]);if(n==1) {printf("1\n");return 0;}b[1]=1;lmax=0;for(i=2;i<=n;i++){max=0;for(j=1;j<i;j++)if(a[i]>a[j]&&b[j]>max)max=b[j];b[i]=max+1;if(lmax<b[i]) lmax=b[i];}printf("%d\n",lmax);}