ZOJ 1986 最长上升子序列

比赛时看着题的太长了，加上又全是英文（英语不太好T_T.....)题意没理解，就放弃了，后来听说是求他的最长上升子序列，我勒个去啊！

一个简单的DP搞这么麻烦的题目。。。。要用O(n*logn)方法过。。。。

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define N 40005

int stack[N];
int main()
{
    int i,temp,ncases;
    int top,n,low,mid,high;    
    
    scanf("%d",&ncases);
    while( ncases-- )
    {
         top = 0;
         stack[0] = -1;    
       scanf("%d",&n);  
       while( n-- )
       { 
          scanf("%d",&temp);  
          if(temp > stack[top]) 
          { 
             stack[++top] = temp; 
          }  
          else
          {
             low = 1, high = top; 
             while(low <= high)
             {
                mid = (low + high)/2; 
                if(temp > stack[mid])
                    low = mid+1; 
                else
                    high = mid-1; 
             } 
             stack[low] = temp; 
          }    
       } 
       
       printf("%d\n",top);
    }
    system("pause");
    return 0;
}