最长上升子序列

二分找位置用小的代替大的- -贪

#include <bits/stdc++.h>
using namespace std;
const int N = 40005;
int s[N];
int main() {
	int t,n,x; scanf("%d", &t);
	while (t--) {
		int top = 0, cnt = 0;
		s[top++] = -1;
		scanf("%d", &n);
		for (int i = 0; i<n; i++) {
			scanf("%d", &x);
			if (x == s[top])continue;
			if (x>s[top]) {
				s[++top] = x;
			}
			else {
				int l = 0, r = top, mid;
				while (l<r) {
					mid = (l + r) >> 1;
					if (s[mid] >= x)r = mid;
					else l = mid + 1;
				}
				s[r] = x;
			}
		}
		printf("%d\n", top);
	}
	return 0;
}