poj2533

#include <iostream>#include <cstdio>#include <cstring>#include <climits>using namespace std;int n,a[1001],dp[1001];int solve(){    for(int i=1;i<=n;++i)        dp[i] = 1;    for(int i=2;i<=n;++i)        for(int j=1;j<i;++j)            if(a[i]>a[j])                dp[i]=max(dp[i],dp[j]+1);    int maxn=INT_MIN;    for(int i=1;i<=n;++i)        maxn=max(maxn,dp[i]);    return maxn;}int main(){    scanf("%d",&n);    for(int i=1;i<=n;++i)        scanf("%d",&a[i]);    printf("%d\n",solve());    return 0;}