J - Longest Ordered Subsequence

J - Longest Ordered Subsequence

Time Limit:2000MS    Memory Limit:65536KB    64bit IO Format:%lld & %llu

SubmitStatus

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

7
1 7 3 5 9 4 8

Sample Output

4
解析：这题可以用DP做。
基本思路：开两个数组dp[1005] x[1005]，DP用来存子序列的长度，X用来存数据。首先对DP赋初值为1。输入一个数X[i]让
它与前边的几个数下X[j]相比较，如果x[i]>x[j]，则dp[i]=dp[j]+1。注意条件dp[i]<=dp[j],和下面代码一起看可能
更好理解。
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int dp[1005],x[1005];
int main()
{
    int n;
    scanf("%d",&n);
    int j;
    for(int i=0; i<n; i++)
    {
        dp[i]=1;
        scanf("%d",&x[i]);
        for( j=0; j<i; j++)
            if(x[i]>x[j]&&dp[i]<=dp[j])
                dp[i]=dp[j]+1;

    }
    int a=0;
    for(int i=0; i<n; i++)
        if(a<dp[i])
            a=dp[i];
    printf("%d\n",a);
}