参考http://par.cse.nsysu.edu.tw/~advprog/advprog2008/11081.doc。
那么 对S3当前第K个字符c, 用t = pos[ i ] [ j ] [ c - 'a']表示Si第 j 个字符以前最近的字符c出现的位置,那样可以省去不少时间
初始化应该f[ 0 ][ i ][ j ]初始化为 1,
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
using namespace std;
#define N 63
int f[N][N][N];
int pos[4][N][26];
int main()
{
char s[4][N];
int t;
int len[4];
scanf("%d", &t);
FILE* fp = fopen("in.txt", "r");
while (t--)
{
fscanf(fp, "%s %s %s", s[1], s[2], s[3]);
len[1] = strlen(s[1]);
len[2] = strlen(s[2]);
len[3] = strlen(s[3]);
memset(pos, -1, sizeof(pos));
memset(f, 0, sizeof(f));
for (int i = 1; i <= 3; i++)
for (int j = 1; j <= len[i]; j++)
for (int k = 0; k < 26; k++)
pos[i][j][k] = (s[i][j - 1] - 'a' == k? j - 1: pos[i][j - 1][k]);
for (int i = 0; i <= len[1]; i++)
for (int j = 0; j <= len[2]; j++)
{
f[0][i][j] = 1;
}
for (int k = 1; k <= len[3]; k++)
{
for (int i = 0; i <= len[1]; i++)
for (int j = 0; j <= len[2]; j++)
{
if (i + j < k)continue;
int t = pos[1][i][s[3][k - 1] - 'a'];
while (t != -1)
{
f[k][i][j] += f[k - 1][t][j];
t = pos[1][t][s[3][k - 1] - 'a'];
}
t = pos[2][j][s[3][k - 1] - 'a'];
while (t != -1)
{
f[k][i][j] += f[k - 1][i][t];
t = pos[2][t][s[3][k - 1] - 'a'];
}
if (f[k][i][j] > 1000000)f[k][i][j] %= 10007;
}
}
printf("%d\n", f[len[3]][len[1]][len[2]] % 10007);
}
getchar();
getchar();
return 0;
}