设dp[k][i][j]表示划分成k份,处理到A串的第i个字符,B串的第j个字符的方案数。
考虑A[i], B[j]能否和A[i - 1], B[j - 1]一组,然后转移就行了。
转移里有个前缀和,转移时候同时递推算出来,就可以O(1)转移了。
/* Pigonometry */
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef unsigned int uint;
const int maxn = 1005, maxm = 205;
const uint p = 1000000007;
int n, m, k;
uint dp[2][maxn][maxm], sum[2][maxn][maxm];
char s1[maxn], s2[maxm];
int main() {
scanf("%d%d%d%s%s", &n, &m, &k, s1 + 1, s2 + 1);
dp[0][0][0] = 1;
for(int i = 0; i <= n; i++) sum[0][i][0] = 1;
for(int t = 1; t <= k; t++) {
memset(dp[t & 1], 0, sizeof(dp[t & 1]));
memset(sum[t & 1], 0, sizeof(sum[t & 1]));
for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) {
if(s1[i] == s2[j]) {
dp[t & 1][i][j] = sum[~t & 1][i - 1][j - 1];
if(s1[i - 1] == s2[j - 1]) (dp[t & 1][i][j] += dp[t & 1][i - 1][j - 1]) %= p;
}
sum[t & 1][i][j] = (sum[t & 1][i - 1][j] + dp[t & 1][i][j]) % p;
}
}
uint ans = 0;
for(int i = 1; i <= n; i++) (ans += dp[k & 1][i][m]) %= p;
printf("%u\n", ans);
return 0;
}