LIS(模板)

记录一下，O(nlgn)的算法求LIS

//HHH
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
#define MX 1005

int num[MX];
int dp[MX];
int high[MX]; // 长为i的最小大小

int bi_search(int x,int h)
{
    int l=1,r=h;
    int res=0;
    while (l<=r)
    {
        int mid = (l+r)/2;
        if (x>high[mid])    //不减序列改为 x>=high[mid]
        {
            res=mid;
            l=mid+1;
        }
        else r=mid-1;
    }
    return res+1;
}

int calc(int l,int r)
{
    if (l>r) return 0;
    memset(high,0,sizeof(high)); //要为最界限值
    int h=1;
    dp[l]=1;
    high[1]=num[l];
    for (int i=l+1;i<=r;i++)
    {
        if (num[i]>high[h]) //不减序列改为 x>=high[mid]
        {
            h++;
            dp[i]=h;
            high[h]=num[i];
        }
        else
        {
            int p=bi_search(num[i],h);
            dp[i]=p;
            high[p]=num[i];
        }
    }
    return h;
}

int main()
{
    int n;
    while (scanf("%d",&n)!=EOF)
    {
        for(int i=1;i<=n;i++)
            scanf("%d",&num[i]);
        printf("%d
",calc(1,n));
    }
    return 0;
}