最长单调子序列问题

代码：

#include<iostream>
#include<vector>
#include <algorithm>
using namespace std;
const int maxn = 1001;
int dp[maxn];

//vector<int>nums = { 10,9,2,5,3,7,101,18 };
//vector<int>nums = { 0, 1, 0, 3, 2, 3 };
vector<int>nums = { 2,8,4,-4,5,9,11 };

int get_length(vector<int>nums)
{
	int result = 0;
	if (nums.size() == 0)
		return 0;
	for (int i = 0; i < nums.size(); ++i)
	{
		for (int j = 0; j < i; ++j)
		{
			if (nums[j] < nums[i])
				dp[i] = max(dp[i], dp[j] + 1);
		}
		result = max(result, dp[i]);  // 取长的子序列
	}	
	return result;
}

//打印原序列
void print_nums()
{
	cout << "原序列：";
	for (int i = 0; i < nums.size(); ++i)
	{
		cout << nums[i] << " ";
	}
	cout << endl;
}
//打印最长单调子序列
void print_line(int num)
{
	int index = num;
	int j = 1;
	vector<int>sequence;
	for (int i = 0; i < nums.size() && j<=num ; ++i)
	{
		//如果第二个数dp == 第一个数dp值，说明第二个数更小，将第二个数压入sequence
		if (dp[i] == j-1)
		{
			sequence.pop_back();
			sequence.push_back(nums[i]);
		}
		// 如果dp[i] ==j 则说明满足题意
		else if (dp[i]==j )
		{
			sequence.push_back(nums[i]);                                    
			j++;
		}
	}
	cout << "最长递增序列：";
	for (int i = 0; i < sequence.size(); ++i)
		cout << sequence[i] << " ";
	cout << endl;
}

int main()
{
	fill(dp, dp +nums.size(), 1);
	int ans = get_length(nums);
	//打印原序列
	print_nums();

	//打印dp序列
	//for (int i = 0; i < nums.size(); ++i)
	//{
	//	cout << dp[i] << " ";
	//}
	/*cout << endl;*/

	//打印最长单调子序列
	print_line(ans);
	cout << "最长子序列长度：" << ans << endl;

	return 0;
}