POJ 2533 LIS模板

n*log(n)  模板

#include "stdio.h"#include "string.h"#include "math.h"int sum;int a[1010],dp[1010];void updata(int x){    int l,r,mid;    l=1;r=sum;    while (l<=r)    {        mid=(l+r)/2;        if (dp[mid]<=x) l=mid+1;        else r=mid-1;    }    dp[l]=x;}int main(){    int n,i;    while (scanf("%d",&n)!=EOF)    {        for (i=1;i<=n;i++)            scanf("%d",&a[i]);        sum=1;        dp[1]=a[1];        for (i=2;i<=n;i++)        {            if (a[i]>dp[sum])            {                sum++;                dp[sum]=a[i];            }            else updata(a[i]);        }        printf("%d\n",sum);    }    return 0;}