HDU 1423

lics水题    一维数组记录

#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
const int N=502;
int a[N],b[N];
int f[N];
int n,m,lics;
void LICS(){
    memset(f,0,sizeof(f));
    lics=0;
    for(int i=1;i<=n;i++){
        int max=0;
        for(int j=1;j<=m;j++){
            if(a[i]>b[j]&&max<f[j])max=f[j];
            if(a[i]==b[j])f[j]=max+1;
        }
    }
    for(int i=1;i<=m;i++)if(lics<f[i])lics=f[i];
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        scanf("%d",&m);
        for(int i=1;i<=m;i++){
            scanf("%d",&b[i]);
        }
        LICS();
        printf("%d
",lics);
        if(t)printf("
");
    }
}

二位数组记录

#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
const int N=502;
int a[N],b[N];
int f[N][N];
int n,m,lics;
void LICS(){
    memset(f,0,sizeof(f));
    lics=0;
    for(int i=1;i<=n;i++){
        int max=0;
        for(int j=1;j<=m;j++){
            f[i][j]=f[i-1][j];
            if(a[i]>b[j]&&max<f[i-1][j])max=f[i-1][j];
            if(a[i]==b[j])f[i][j]=max+1;
        }
    }
    for(int i=1;i<=m;i++)if(lics<f[n][i])lics=f[n][i];
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        scanf("%d",&m);
        for(int i=1;i<=m;i++){
            scanf("%d",&b[i]);
        }
        LICS();
        printf("%d
",lics);
        if(t)printf("
");
    }
}