Longest Ordered Subsequence - 最长上升子序

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

分析：

最长上升子序：LIS - Longest Increasing Subsequence

首先建立递推关系：dp[i]:=以ai结尾的最长上升子序的列的长度

以ai结尾的上升子序列是：

1）只包含ai的子序列，即长度为1

2）在满足j<i并且aj<ai的以aj结尾的序列中，末尾加上ai，即长度大于等于1

===》得到递推关系：dp[i]=max(1,dp[j]+1)  (i<j且aj<ai)

代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[1005],dp[1005];
int main(){
    int N;
    scanf("%d",&N);
    for(int i=0;i<N;i++){
        scanf("%d",&a[i]);
    }
    int res=0;
    for(int i=0;i<N;i++){
        dp[i]=1;//以ai结尾的序列长度至少为1
        for(int j=0;j<i;j++){
            if(a[j]<a[i])dp[i]=max(dp[i],dp[j]+1);
        }
        res=max(res,dp[i]);//res选出以a0到aN-1结尾的序列的最大值即为LIS
    }
    printf("%d\n",res);
}