Longest Ordered Subsequence(POJ--2533

最新推荐文章于 2021-07-30 10:07:39 发布

IF_I

最新推荐文章于 2021-07-30 10:07:39 发布

阅读量271

点赞数

分类专栏： --------------动态规划------------ 动态规划 ------------POJ-杂七杂八----------

本文链接：https://blog.csdn.net/zhang_di233/article/details/47782231

版权

------------POJ-杂七杂八---------- 同时被 3 个专栏收录

86 篇文章 0 订阅

订阅专栏

--------------动态规划------------

19 篇文章 0 订阅

订阅专栏

动态规划

11 篇文章 0 订阅

订阅专栏

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_i₁, a_i₂, ..., a_{i_K}), 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.

题意：输入n个数，求这n个数的最长上升子序列的长度。

思路：用数组dp[i]来记录以第i个数为上升子序列的最后一个数的长度，枚举这n个数，只要当前这个数前边有比它小的数，就让当前这个数的dp与比它小的那个数的dp+1比较，哪个大当前数的dp就等于哪个。（注意：如果前边没有比当前这个数小的数，那么当前这个数的dp就等于1，它本身也是一个上升子序列。PS：上升子序列是严格的递增序列。）

Sample Input

7
1 7 3 5 9 4 8

Sample Output

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;
int dp[1200],a[1200];
int main()
{
    //freopen("lalala.text","r",stdin);
    int n;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
        scanf("%d",&a[i]);
    memset(dp,0,sizeof(dp));
    dp[0]=1;  
    for(int i=1; i<n; i++)
    {
        int flag=1;
        for(int j=i-1; j>=0; j--)
        {
            if(a[i]>a[j])
            {
               flag=0;      //标记当前数之前有数小于它
                dp[i]=max(dp[i],dp[j]+1);
            }
        }
        if(flag)       //如果当前数之前没有数小于它，则它本身相当于一个上升子序列，已其为结尾的上升子序列的长度为1
        dp[i]=1;
    }
    int mm=-1;               //最长上升子序列的长度并不一定是dp[n-1]，要枚举所有的dp，然后就最大即最长
    for(int i=0; i<n; i++)
        if(dp[i]>mm)
            mm=dp[i];
    printf("%d\n",mm);
    return 0;
}<strong>
</strong>