POJ-2533

#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int a[1005];int dp[1005];int main(){    int N;    while(~scanf("%d",&N)){    int i,j;    for(i=0;i<N;i++)        cin>>a[i];    dp[0]=1;    int max=1;    for(i=1;i<N;i++){        int flag=-1;        int max1=-1;        for(j=i-1;j>=0;j--)        if(a[j]<a[i]&&dp[j]>max1){            max1=dp[j];            flag=j;        }        if(flag!=-1)dp[i]=dp[flag]+1;        else dp[i]=1;        if(dp[i]>max)max=dp[i];    }    cout<<max<<endl;    }    return 0;}