POJ 2533

#include<iostream>
#include<algorithm>
#define MAXN 1005
using namespace std;

int dp[MAXN];
int date[MAXN];

int main()
{
    //freopen("acm.acm","r",stdin);
    int num;
    int i;
    int max;
    int j;
    cin>>num;
    for(i = 0; i < num; ++ i)
    {
        cin>>date[i];
    }
    for(i = 0; i < num; ++ i)
    {
        dp[i] = 1;
    }
    for(i = num - 1; i >= 0; -- i)
    {
        max = 0;
        for(j = i + 1; j < num; ++ j)
        {
            if(date[j] > date[i])
            {
                if(dp[j] > max)
                {
                    max = dp[j];
                }
            }
        }
        dp[i] += max;
    }
    cout<<*max_element(dp,dp+num)<<endl;
}