题意:一道最长上升子序列,不过数据较大
题解:n2的话会超时,因此采用O(nlog(n))算法,dp[i] 表示长度为i的上升子序列末尾最小值,len记录当前长度最大值,采用二分查找在dp[i]中寻找大于a[i] 的最小值并且替换
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 40010
int n,len,a[maxn],dp[maxn];
int binary(int x)
{
int left = 1,right = len;
int mid;
while(left < right)
{
mid = (left+right) / 2;
if(dp[mid] >= a[x])
right = mid;
else
left = mid + 1;
}
return left;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(dp,0,sizeof(dp));
scanf("%d",&n);
for(int i = 0; i < n; i++)
scanf("%d",&a[i]);
dp[1] = a[0];
len = 1;
for(int i = 1; i < n; i++)
{
if(a[i] > dp[len])
dp[++len] = a[i];
else
{
int pos = binary(i);
dp[pos] = a[i];
}
}
printf("%d\n",len);
}
}