伪·最长公共子序列个数

题意简述：给出两个字符串A，B。设最长公共子序列长度为$L$，求A中有多少长度为$L$的子序列也在B串中出现。（注意不是最长公共子序列）$(|A|,|B|\leq1000)$
设$f[i][j]$为A串中前$i$个和B串中前$j$个最长公共子序列长度，$g[i][j]$为A串中前$i$个和B串中前$j$个最长公共子序列个数。考虑如果$a[i] == b[j]$，那么首先$a[i]$可以和$b[j]$匹配，如果$a[i]$不和$b[j]$匹配也可以达到A串前$i$个和B串前$j$个匹配的长度，那么$a[i]$也可以不和$b[j]$匹配，所以式两种方案相加。如果$a[i] != b[j]$，就容斥一下。

#include<bits/stdc++.h>
const int N = 1050;
const int P = 1e9 + 7;
int n,m,f[N][N],g[N][N];
char a[N],b[N];
int main(){
    freopen("C.in","r",stdin);
    freopen("C.out","w",stdout);
    scanf("%s",a + 1);
    scanf("%s",b + 1);
    n = strlen(a + 1);
    m = strlen(b + 1);
    for (int i=0; i<=n; i++) g[i][0] = 1;
    for (int j=0; j<=m; j++) g[0][j] = 1;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=m; j++){
            if (a[i] == b[j])
                f[i][j] = f[i - 1][j - 1] + 1;
            else
                f[i][j] = std::max(f[i - 1][j], f[i][j - 1]);
            if (a[i] == b[j])
                g[i][j] = g[i - 1][j - 1] + (f[i][j] == f[i - 1][j]) * g[i - 1][j];
            else{
                if (f[i][j - 1] == f[i][j]) g[i][j] += g[i][j - 1];
                if (f[i - 1][j] == f[i][j]) g[i][j] += g[i - 1][j];
                if (f[i - 1][j - 1] == f[i][j]) g[i][j] -= g[i - 1][j - 1];
            }
            g[i][j] = (g[i][j] % P + P) % P;
        }
    printf("%d\n",g[n][m]);
    return 0;
}

真·最长公共子序列个数

#include<bits/stdc++.h>
const int N = 1050;
const int P = 1e9 + 7;
int n,m,f[N][N],g[N][N];
char a[N],b[N];
int main(){
    freopen("C.in","r",stdin);
    freopen("C.out","w",stdout);
    scanf("%s",a + 1);
    scanf("%s",b + 1);
    n = strlen(a + 1);
    m = strlen(b + 1);
    for (int i=0; i<=n; i++) g[i][0] = 1;
    for (int j=0; j<=m; j++) g[0][j] = 1;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=m; j++){
            if (a[i] == b[j])
                f[i][j] = f[i - 1][j - 1] + 1;
            else
                f[i][j] = std::max(f[i - 1][j], f[i][j - 1]);
            if (f[i][j - 1] == f[i][j]) g[i][j] = (g[i][j] + g[i][j - 1]) % P;
            if (f[i - 1][j] == f[i][j]) g[i][j] = (g[i][j] + g[i - 1][j]) % P;
            if (f[i - 1][j - 1] == f[i][j]) g[i][j] = (g[i][j] - g[i - 1][j - 1] + P) % P;
            if (a[i] == b[j]) g[i][j] = (g[i][j] + g[i - 1][j - 1]) % P;
        }
    printf("%d\n",g[n][m]);
    return 0;
}