POJ 2533

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

图利猫

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

阅读量140

点赞数

本文链接：https://blog.csdn.net/asd7788999/article/details/80300508

版权

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

求最长递增子序列，dp[i]表示已i为结尾的最长递增子序列的长度，求出所有的dp之后遍历一遍，找到最长的即可

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int dp[1005];
int a[1005];
int main(){
	int n;
	while(~scanf("%d",&n)){
		for(int i=1;i<=n;i++) scanf("%d",&a[i]);
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;i++){
			dp[i]=1;
			for(int j=1;j<i;j++){
				if(a[i]>a[j]) dp[i]=max(dp[i],dp[j]+1);
			}
		}
		int Max=0;
		for(int i=1;i<=n;i++){
			if(dp[i]>Max) Max=dp[i];
		}
		printf("%d\n",Max);
	}
}