poj 2533 Longest Ordered Subsequence

题目链接：点击打开链接

Description

A numeric sequence of a_i is ordered if a₁ < a₂ < ... < a_N. Let the subsequence of the given numeric sequence (a₁, a₂, ..., a_N) be any sequence (a_i1,a_i2, ..., a_iK), where 1 <= i₁ < i₂ < ... < i_K <= 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

71 7 3 5 9 4 8

Sample Output

4

ps：简单Dp  求最长上升子序列

<span style="font-size:18px;">#include <iostream>using namespace std;int main(){    int n;    int a[1010];    int b[1010];    cin>>n;    for(int i=0;i<n;i++)    {        cin>>a[i];    }    int m;    b[0]=1;    for(int i=1;i<n;i++)    {        m=0;        for(int j=0;j<i;j++)        {            if(a[i]>a[j])            {                if(b[j]>m)                    m=b[j];            }        }        b[i]=m+1;    }    int mx=-1;    for(int i=0;i<n;i++)    {        if(mx<b[i])mx=b[i];    }    cout<<mx<<endl;    return 0;}</span>