HDU 1950最长上升子序列 学习nlogn

题目链接

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
const int INF = 0x3f3f3f3f;
int a[40004];
int dp[40004];
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
int p;
scanf("%d", &p);
for(int i = 1;i <= p;i++)
scanf("%d",&a[i]);
memset(dp, INF, sizeof(dp));
for(int i = 1;i <= p;i++)
*lower_bound(dp + 1, dp + 1 + p, a[i]) = a[i];
int ans = lower_bound(dp + 1, dp + 1 + p, INF) - (dp + 1);
printf("%d\n", ans);
}
return 0;
}