最长上升子序列O(nlogn)算法模板

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int a[]={1,2,4,3,9,6};
int b[7],dp[6];

int bsearch(int b[],int n,int v)
{
    int low=1;
    int high=n;
    while(low<=high)
    {
        int mid=(low+high)/2;
        if(b[mid]==v)return mid;
        if(b[mid]>v)
            high=mid-1;
        else
            low=mid+1;
    }
    return low;
}

int main()
{
    int maxlen=1;
    b[maxlen]=a[0];
    dp[0]=1;
    for(int i=1;i<6;i++)
    {
        if(a[i]>b[maxlen])
        {
            b[++maxlen]=a[i];
            dp[i]=maxlen;
        }
        else
        {
            int p=bsearch(b,maxlen,a[i]);
            b[p]=a[i];
            dp[i]=p;
        }
    }
    printf("%d\n",maxlen);
    for(int i=0;i<6;i++)
        printf("%d ",dp[i]);
    printf("\n");

    return 0;
}