[POJ1631] nlogn求LIS

用到了algorithm自带的lower_bound函数进行二分查找

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int p,n,ans;
],b[],sum[];

signed main(){
    scanf("%d",&p);
    while(p--){
        ans=;
        memset(b,0x3f,sizeof b);
        memset(sum,,sizeof sum);
        scanf("%d",&n);
        ;i<=n;i++) scanf("%d",&a[i]);
        ;i<=n;i++){
            ,b++n,a[i])-b;
            b[k]=a[i];
            sum[i]=k;
        }
        ;i<=n;i++) ans=max(ans,sum[i]);
        printf("%d\n",ans);
    }
    ;
}