O(nlogn)时间内的最长递增子序列问题

SalmJohn

已于 2023-11-19 12:03:24 修改

阅读量51

点赞数 1

文章标签： c++ visualstudio

于 2023-11-19 11:57:25 首次发布

本文链接：https://blog.csdn.net/weixin_62528564/article/details/134488694

版权

nlogn时间内的最长递增子序列问题

废话不多说直接上代码：

#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
int main() {
	int n;
	cout << "长度:";
	cin >> n;
	int* a = new int[n];//原序列
	int* r = new int[n] ;//推导关系
	int* fi = new int[n+1];//fi[i]表示长度为i的子序列的尾数的下标
	cout << "输入 " << n << " 个数字：" << endl;
	for (int i = 0; i <n; i++) {//初始化
		int t;
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		r[i] = -1;
		fi[i] = -1;
	}
	fi[n] = -1;

	vector<int> f(n + 1, INT_MAX);//f[i]表示长度为i的子序列的尾数
	f[0] = INT_MIN;

	int maxs = 1;
	int j=0;
	for (int i = 0; i < n; i++) {
		int s= lower_bound(f.begin(), f.end(), a[i])-f.begin();
		if (s!=1) {
			r[i] = fi[s - 1];
		}
		f[s] = a[i];
		fi[s] = i;
		maxs = max(s, maxs);
	}
	cout << "长度：" << maxs << endl<<"长度为i的子序列的尾数：\n";
	for (int i = 1; i <=n;i++) {
		if (f[i] == INT_MAX)
			break;
		cout << f[i] << "  ";
	}	cout << endl<<"长度为i的子序列的尾数的a中下标：\n";
	for (int i = 1; i <= n; i++) {
		if (fi[i] == -1)
			break;
		cout << fi[i] << "  ";
	}
	cout << endl<<"推到关系：（r[i]=j表示子序列中若有a[i]那它前面必然是a[j]）\n";
	for (int i = 0; i < n; i++) {
		cout <<"r[" <<i<<"]-> " << r[i] << "  ";
	}
	cout << "\n最长子序列长度为 " << maxs << " 尾数为 " << f[maxs] << " 尾数在a中下标为 " << fi[maxs] << endl;
	cout << "所以最长递增子序列从后往前为：\n";
	int i = fi[maxs];
	while (i != -1) {
		cout << a[i] << " ";
		i = r[i];
	}
	delete(r);
	delete(a);
	delete(fi);
	return 0;
}