ZOJ 2136 Longest Ordered Subsequence

#include<time.h>
#include <cstdio>  
#include <iostream>  
#include<algorithm>
#include<math.h> 
#include <string.h>  
#include<vector> 
#include<queue>
using namespace std;

int d[100005],a[100005];
int len,i,k,n,m;

int binary(int t)
{
    int low,high,mid;
    low=0;
    high=len;
    while(low<high)
    {
　　　　　　 //mid=low+(high-low)*(num-p[low])/(p[high]-p[low]);//插值排序
        mid=(low+high)/2;
        if(d[mid]<=t)
            low=mid+1;
        else
            high=mid;
    }
    return low;
}

int main()
{
    int cas;
    cin>>cas;
    while(cas--)
    {
        cin>>n;
        for(i=1;i<=n;i++)
            cin>>a[i];
        len=0;
        d[0]=-99999;
        for(i=1;i<=n;i++)
        {
            if(a[i]>d[len])
            {
                len++;
                d[len]=a[i];
                //cout<<d[len]<<" ";
            }
            else
            {
                k=binary(a[i]);
                d[k]=a[i];
            }
        }
        cout<<len<<endl;
        if(cas)                //这里是个坑 
            cout<<endl;
    }
    return 0;
}