Hdu 1950

题目链接

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;

#define debug(x) cout << #x << " is " << x << endl
#define inc(i, a, b) for (int i = a; i <= b; ++i)
typedef long long ll;
const int INF = 0x3f3f3f3f, N = 4e4 + 5;

int t, n;
int a[N], dp[N];

int main() 
{
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		for (int i = 1; i <= n; ++i) { 
			scanf("%d", &a[i]);
			dp[i] = INF;
		}
		for (int i = 1; i <= n; ++i) {
			*lower_bound(dp + 1, dp + n + 1, a[i]) = a[i];
		}
		printf("%lld\n", lower_bound(dp + 1, dp + n + 1, INF) - dp - 1);
	}
    return 0;
}