Longest Ordered Subsequence （最长有序（递增）序列）

最新推荐文章于 2024-09-14 18:02:51 发布

原创最新推荐文章于 2024-09-14 18:02:51 发布 · 640 阅读

0 ·

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

本文介绍了一种在给定数列中找到最长有序子序列的方法，包括两种算法：时间复杂度为n^2的动态规划算法和理论上为nlogn但未实现的优化算法。通过实例演示了如何应用这些算法解决实际问题。

Longest Ordered Subsequence

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 31353		Accepted: 13688

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.

Sample Input

7
1 7 3 5 9 4 8

Sample Output

【时间复杂度 n^2算法】

dp【i】表示以arr【i】为结尾的最大子序列的最大长度！这里是以arr【i】为最大值的

所以答案是遍历dp，取最大值

初始 dp[] = 1;

F[i] = { F[j] +1} (j = 1, 2, ..., i - 1, if A[j] < A[i]！！！)。

#include<iostream>
#include<algorithm>
using namespace std;
int main(void){
	int n;
	while(cin>>n){
		int * arr = new int [n];
		for(int i=0;i<n;i++)
			cin>>arr[i];
		int * dp = new int [n];
		for(int i=0;i<n;i++)
			dp[i] = 1;
		for(int i=0;i<n;i++){
			int ans =1;
			for(int j=0;j<i;j++){
				if(arr[i]>arr[j]){
					ans = max(ans,dp[j]+1);
				}
			}
			dp[i] = ans;
		}
		int ans=dp[1];
		for(int i=0;i<n;i++){
			//cout<<dp[i]<<' ';
			ans = max(ans,dp[i]);
		}
		//cout<<endl;
		cout<<ans<<endl;
		delete[]arr,dp;
	}

	return 0;
}

【nlogn 算法】

没实现。。。。百度之

标签