最长公共子序列LCS C++实现

#include <iostream>#include <cstdio>#include <cstring>using namespace std;char a[1005],b[1005];int f[1005][1005];int main(){    scanf("%s",a+1);    scanf("%s",b+1);    int lena=strlen(a+1);    int lenb=strlen(b+1);    for (int i=1;i<=lena;i++){        for (int j=1;j<=lenb;j++){            if (a[i]==b[j]){                f[i][j]=f[i-1][j-1]+1;            }else{                f[i][j]=max(f[i-1][j],f[i][j-1]);            }        }    }    printf("%d\n",f[lena][lenb]);}