输出K个最长递增子序列。

思路，滑动窗口，然后快排。

#include <iostream>
#include<cstdlib>
#include<cstring>
#include<vector>
using namespace std;

struct record
{
	int length = 0;
	int start = 0;
	int end = 0;
};

void quickSort(record* r, int left, int right)
{
	if (left >= right)
		return;
	int temp = r[left].length;
	record tempRecord;
	memcpy(&tempRecord, &r[left], sizeof(record));
	int i = left, j = right;
	while (i < j)
	{
		while (i < j && r[j].length >= temp)
		{
			--j;
		}
		if (i < j)
		{
			memcpy(&r[i], &r[j], sizeof(record));
		}
		while (i < j && r[i].length <= temp)
		{
			++i;
		}
		if (i < j)
		{
			memcpy(&r[j], &r[i], sizeof(record));
		}
	}
	memcpy(&r[i], &tempRecord, sizeof(record));
	quickSort(r, left, i - 1);
	quickSort(r, i + 1, right);
}

int main()
{
	vector<int> arr;
	int tempIn[10] = {2, 1, 4, 5, 8, 3, 7, 10, 2, 5};
	for (int i = 0; i < 10; ++i)
	{
		arr.push_back(tempIn[i]);
	}
	int k = 3;
	record* r = new record[k];
	int left = 0;
	int right = 1;
	int arrSize = 0;
	while (right < arr.size())
	{
		
		if (arr[right] < arr[right - 1])
		{
			//不是升序，更新数组和left
			int tempLength = right - left;

			if (arrSize < k)
			{
				arrSize++;
				for (int i = 0; i < k; ++i)
				{
					if (r[i].length == 0)
					{
						r[i].length = tempLength;
						r[i].start = left;
						r[i].end = right;
						break;
					}
				}
			}
			else
			{
				for (int i = 0; i < k; ++i)
				{
					if (r[i].length < tempLength)
					{
						r[i].length = tempLength;
						r[i].start = left;
						r[i].end = right;
						break;
					}
				}
			}

			left = right;
			++right;
		}
		else
		{
			++right;
		}
	}
	//最后一次可能更新不到。
	int tempLength = right - left;

	if (arrSize < k)
	{
		arrSize++;
		for (int i = 0; i < k; ++i)
		{
			if (r[i].length == 0)
			{
				r[i].length = tempLength;
				r[i].start = left;
				r[i].end = right;
				break;
			}
		}
	}
	else
	{
		for (int i = 0; i < k; ++i)
		{
			if (r[i].length < tempLength)
			{
				r[i].length = tempLength;
				r[i].start = left;
				r[i].end = right;
				break;
			}
		}
	}
	quickSort(r, 0, k - 1);
	for (int i = 0; i < k; ++i)
	{
		int tempLeft = r[i].start;
		int tempRight = r[i].end;
		for (int i = tempLeft; i < tempRight; ++i)
		{
			cout << arr[i] << " ";
		}
		cout << endl;
	}
}