poj 1631

做dp发现的题目，题解说LCS。第一次，看看4000，暴力有点不科学了，LCS n*logn 了

http://www.cnblogs.com/gj-Acit/p/3236384.html LCS学习！

#include <iostream>
#include <cstdio>
using namespace std;


int a[40001],h[40001];
int n;


int bsearch(int r,int a)
{
int l = 0;
r = r - 1; 
while(l <= r)
{
int mid = (l + r) / 2;
if(a <= h[mid] && a > h[mid-1]) return mid;
else if(a < h[mid]) r = mid - 1;
else l = mid+1;
}
return l;
}
int LCS()
{
int size = 1;
h[0] = a[0];
for(int i = 1; i < n; i++)
{
int j;
if(a[i] < h[0])
j = 0;
else if(a[i] > h[size-1])
 j = size++;
else j = bsearch(size,a[i]);

h[j] = a[i];
}
return size;
}
int main()
{
int t;
scanf(" %d",&t);
while(t--)
{
scanf(" %d",&n);
for(int i = 0; i < n; i++)
 scanf(" %d",&a[i]);
printf("%d\n",LCS());
}
return 0;
}