zoj1986 Bridging Signals(DP)
/*
单调队列优化的最大上升子序列 O（NlogN）算法
*/
View Code
1 #include <stdio.h>
2 #include <stdlib.h>
3 #include <string.h>
4
5 int data[ 40000 ];
6 int Queu[ 40000 ];
7
8 int Search( int h, int key )
9 {
10 if ( key <= Queu[ 0 ] ) return 0;
11 int m,l = 0;
12 while ( l < h ) {
13 m = (h+l)>>1;
14 if ( Queu[ m ] >= key )
15 h = m;
16 else l = m+1;
17 }
18 return h;
19 }
20
21 int main()
22 {
23 int n,m,i;
24 while ( scanf("%d",&m) != EOF )
25 while ( m -- ) {
26 scanf("%d",&n);
27 for ( i = 0 ; i < n ; ++ i )
28 scanf("%d",&data[ i ]);
29 int tail = 0;
30 Queu[ 0 ] = data[ 0 ];
31 for ( i = 1 ; i < n ; ++ i )
32 if ( Queu[ tail ] < data[ i ] )
33 Queu[ ++ tail ] = data[ i ];
34 else
35 Queu[ Search( tail, data[ i ] ) ] = data[ i ];
36 printf("%d\n",tail+1);
37 }
38 return 0;
39 }
