题目:最大上升子序列。
分析:dp,单调队列。单调队列优化的O(NlogN)算法。
说明:单调队列中存前面所有数据组成的下标长度的LIS最小的结束值。(2011-09-19 09:36)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int data[ 40000 ];
int Queu[ 40000 ];
int Search( int h, int key )
{
if ( key <= Queu[ 0 ] ) return 0;
int m,l = 0;
while ( l < h ) {
m = (h+l)>>1;
if ( Queu[ m ] >= key )
h = m;
else l = m+1;
}
return h;
}
int main()
{
int n,m,i;
while ( scanf("%d",&m) != EOF )
while ( m -- ) {
scanf("%d",&n);
for ( i = 0 ; i < n ; ++ i )
scanf("%d",&data[ i ]);
int tail = 0;
Queu[ 0 ] = data[ 0 ];
for ( i = 1 ; i < n ; ++ i )
if ( Queu[ tail ] < data[ i ] )
Queu[ ++ tail ] = data[ i ];
else
Queu[ Search( tail, data[ i ] ) ] = data[ i ];
printf("%d\n",tail+1);
}
return 0;
}