Longest Ordered Subsequence

最新推荐文章于 2022-08-30 19:25:01 发布

尉水风

最新推荐文章于 2022-08-30 19:25:01 发布

阅读量246

点赞数

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

本文链接：https://blog.csdn.net/smoggyxhdz/article/details/77170419

版权

动态规划专栏收录该内容

41 篇文章 0 订阅

订阅专栏

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.

Sample Input

7
1 7 3 5 9 4 8

Sample Output

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define maxn 100005
using namespace std;
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int res=0,dp[maxn]={0},an[1005]={0};
		for(int i=0;i<n;i++)
			scanf("%d",&an[i]);
		for(int i=0;i<n;i++)
		{
			dp[i]=1;
			for(int j=0;j<i;j++)
			{
				if(an[j]<an[i])
				{
					dp[i]=max(dp[i],dp[j]+1);
				}
			}
			res=max(res,dp[i]);
		}
		printf("%d\n",res);
	}
	return 0;
}