lcs模板

#include<cstdio>
#include<iostream>
#include<cstring>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<cstdlib>
#include<algorithm>
using namespace std;
int n,a[1100000],b[1100000],t1,f[1100000],low[1100000],len=1;
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]),f[a[i]]=i;
    for(int i=1;i<=n;i++) scanf("%d",&b[i]),b[i]=f[b[i]];
    low[1]=b[1];
    for(int i=2;i<=n;i++){
        if(b[i]>low[len]) low[++len]=b[i];
        else t1=lower_bound(low+1,low+len+1,b[i])-low,low[t1]=b[i];
    }
    printf("%d",len);
} 

#include<cstdio>
#include<cstring>
#include<iostream>
char a[1100000],b[1100];
int ans,dp[1100][1100],now[27],nex[1100000][26];
int main(){
    freopen("t1.in","r",stdin);
    freopen("t1.out","w",stdout);
    gets(a+1);int lena=strlen(a+1);
    gets(b+1);int lenb=strlen(b+1);
    for(int i=0;i<26;i++) now[i]=lena+1;
    for(int i=lena;i>=0;i--) {
        for(int j=0;j<26;j++) nex[i][j]=now[j];
        now[a[i]-'a']=i;
    }
    memset(dp,127/3,sizeof dp);
    dp[0][0]=0;
    for(int i=0;i<lenb;i++)
    for(int j=0;j<=i;j++)
        if(dp[i][j]<lena)   {
            dp[i+1][j]=std::min(dp[i][j],dp[i+1][j]);
            dp[i+1][j+1]=std::min(dp[i+1][j+1],nex[dp[i][j]][b[i+1]-'a']);

        }
    for(int i=1;i<=lenb;i++)
    ans=(dp[lenb][i]<=lena)?i:ans;
    printf("%d",ans);
}