【DP】计算一个数组的最长递增子序列

vector<int> LongestSubsequence(const vector<int> &num)
{
	if (num.size() <= 1)
		return num;
	vector<int> longest(num.size(), 1);
	for (int i = 1; i < num.size(); i++)
	{
		if (num[i] >= num[i - 1])
			longest[i] = longest[i - 1] + 1;
	}
	int max = longest[0],end=0;
	for (int i = 1; i < num.size(); i++)
	{
		if (longest[i]>max)
		{
			max = longest[i];
			end = i;
		}
			
	}
	vector<int> res;
	for (int i = end - max + 1; i <= end; i++)
		res.push_back(num[i]);
	return res;
}