POJ 2533 Longest Ordered Subsequence （LIS DP）

最长公共自序列LIS

三种模板，但是邝斌写的好像这题过不了

N*N

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 41000;
int a[1010],dp[1010],n;
int Lis(){
   dp[1]=1;
   int ans=1;
   int temp=0;
   for(int i=2;i<=n;i++){
      temp=0;
      for(int j=1;j<i;j++){
        if(dp[j]>temp&&a[i]>a[j]){
            temp=dp[j];
        }
      }
      dp[i]=temp+1;
      if(dp[i]>ans){
        ans=dp[i];
      }
   }
   return ans;
}
int main(){
    while(~scanf("%d",&n)){
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        printf("%d
",Lis());
    }
     return 0;
}

N*logn

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;

int a[1005],dp[1005],c[1005],n;

int bin(int sizee,int k)
{
    int l = 1,r = sizee;
    while(l<=r)
    {
        int mid = (l+r)/2;
        if(k>c[mid] && k<=c[mid+1])
            return mid+1;
        else if(k<c[mid])
            r = mid-1;
        else
            l = mid+1;
    }
}

int LIS()
{
    int i,j,ans=1;
    c[1] = a[1];
    dp[1] = 1;
    for(i = 2; i<=n; i++)
    {
        if(a[i]<=c[1])
            j = 1;
        else if(a[i]>c[ans])
            j = ++ans;
        else
            j = bin(ans,a[i]);
        c[j] = a[i];
        dp[i] = j;
    }
    return ans;
}

int main()
{
    int i;
    while(~scanf("%d",&n))
    {
        for(i = 1; i<=n; i++)
            scanf("%d",&a[i]);
        printf("%d
",LIS());

    }
    return 0;
}

没有AC

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#define clc(a,b) memset(a,b,sizeof(a))
#define LL long long
#include<cmath>
const int inf=0x3f3f3f3f;
using namespace std;
const int MAXN=500010;
int a[MAXN],b[MAXN];
int Serch(int num,int low,int high) {
    int mid;
    while(low<=high) {
        mid=(low+high)/2;
        if(num>=b[mid])
            low=mid+1;
        else high=mid-1;
    }
    return low;
}
int Dp(int n) {
    int i,len,pos;
    b[1]=a[1];
    len=1;
    for(i=2; i<=n; i++) {
        if(a[i]>=b[len]) {
            len=len+1;
            b[len]=a[i];
        } else {
            pos=Serch(a[i],1,len);
            b[pos]=a[i];
        }
    }
    return len;
}

int main() {
    int n;
    while(~scanf("%d",&n)) {
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        printf("%d
",Dp(n));
    }
}