poj 2533 Longest Ordered Subsequence

Longest Ordered Subsequence

Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 35239 Accepted: 15471

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

求最长上升子序列。定义一个一位数组dp[n]，dp[i]表示到第i个数的最长上升子序列。

代码如下：

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <set>#include <queue>using namespace std;#define maxn 1005#define inf 0x7ffffffint arr[maxn];int dp[maxn];int n;int main(){    scanf("%d",&n);    for(int i = 0;i < n; i++){        scanf("%d",&arr[i]);    }    for(int i = 0; i <= n; i++){        dp[i] = 1;    }    for(int i = 0; i < n; i++){        for(int j = i ;j >= 0;j--){            if(arr[i] > arr[j]){                dp[i] = max(dp[i],dp[j]+1);            }        }    }    for(int i = 0; i < n; i++){        dp[n] = max(dp[n],dp[i]);    }    printf("%d\n",dp[n]);    return 0;}