最长上升子序列模板与优化后的模板

未优化

#include
using namespace std;

const int N = 1e5+10;

int n, ans;
int a[N], f[N];

int main()
{
	cin >> n;
	for (int i = 1;i > a[i];
		f[i] = 1;
		for (int j = 1;j  a[j])
				f[i] = max (f[i], f[j] + 1);
		ans = max (ans, f[i]);
	}	
	
	cout  n;
	for (int i = 1;i > a[i];
		if (a[i] > d[len]) d[++len] = a[i];
		else d[binary_search (a[i])] = a[i];
	}	
	
	cout