poj 2533 最大上升子序列

最新推荐文章于 2024-04-12 01:32:49 发布

原创最新推荐文章于 2024-04-12 01:32:49 发布 · 526 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

dp 专栏收录该内容

64 篇文章

订阅专栏

本文介绍了一种寻找给定数列中最长递增子序列长度的方法，并提供了一个具体的编程实现示例。通过动态规划的方式，算法能够高效地解决这一经典问题。

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
4
状态转移方程 dp[i] =max(dp[i],dp[j]+1);

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int dp[200000];
int a[200000];
int main()
{
    int n;
    while(cin>>n)
    {
        memset(dp,0,sizeof(dp));
        if (n == 0) {  
        printf ("1\n");  
        continue;  
        }  
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        dp[i]=1;
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=i-1;j>0;j--)
        {
            if(a[i]>a[j]) dp[i]=max(dp[i],dp[j]+1);
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++) ans=max(ans,dp[i]);
    printf("%d\n",ans );
    }
}