POJ2533——Longest Ordered Subsequence(简单的DP)

Longest Ordered Subsequence

Description
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
Input
The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input
7
1 7 3 5 9 4 8
Sample Output
4

题目大意：

　　　　给定一个数列，输出其最长递增子序列的长度。

解题思路：

　　　　水题，不解释。

Code：

/*************************************************************************
    > File Name: poj2533.cpp
    > Author: Enumz
    > Mail: 369372123@qq.com
    > Created Time: 2014年10月27日 星期一 20时07分22秒
 ************************************************************************/

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<list>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<climits>
#define MAXN 1001
using namespace std;
int date[MAXN];
int dp[MAXN];
int main()
{
    int N;
    while (cin>>N)
    {
        for (int i=1;i<=N;i++)
            cin>>date[i];
        for (int i=1;i<=MAXN-1;i++)
            dp[i]=1;
        int Max=1;
        for (int i=2;i<=N;i++)
        {
            for (int j=1;j<=i-1;j++)
                if (date[j]<date[i])
                    dp[i]=max(dp[i],dp[j]+1);
            Max=max(Max,dp[i]);
        }
        cout<<Max<<endl;
    }
    return 0;
}