Longest Ordered Subsequence （最长上升子序列）

最新推荐文章于 2021-07-30 17:43:41 发布

deebcjrb

最新推荐文章于 2021-07-30 17:43:41 发布

阅读量356

点赞数 3

CC 4.0 BY-SA版权

分类专栏：最长上升子序列文章标签：最长上升子序列

本文链接：https://blog.csdn.net/weixin_43791787/article/details/97396252

最长上升子序列专栏收录该内容

2 篇文章

订阅专栏

本文详细介绍了一种求解最长递增子序列(LIS)问题的动态规划算法，通过实例展示了算法的运行过程，适用于解决序列中最长有序子集的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题目：

A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence ( a1, a2, ..., aN) be any sequence ( ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= 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

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
    int n,d[1005],dp[1005];
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0; i<n; i++)
        {
            scanf("%d",&d[i]);
        }
        for(int i=0; i<n; i++)
        {
            dp[i]=1;
            for(int j=0; j<i; j++)
            {
                if(d[i]>d[j])
                {
                    dp[i]=max(dp[i],dp[j]+1);
                }
            }
        }
        int ans=-1;
        for(int i=0; i<n; i++)
        {
            ans=max(ans,dp[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}

中文概要：给你一个字符数组，让你求最大上升子序列

思路：
O(N^2)做法：dp动态规划

状态设计：dp[i]代表以a[i]结尾的LIS的长度
状态转移：dp[i]=max(dp[i], dp[j]+1) (0<=j< i, a[j]< a[i])
边界处理：dp[i]=1 (0<=j< n)
时间复杂度：O(N^2)
举例：对于序列(1, 7, 3, 5, 9, 4, 8)，dp的变化过程如下