题意:给定两个字符串,求构造一个字符串包含这两个字符串,求最短的构造字符串和不同构造字符串的数量。
思路:dp[x][y]数组表示从a[1]~a[x],b[1]~b[y]所能构造的最短字符串的长度,ans[x][y]表示a[1]~a[x],b[1]~b[y]所能构造的字符串的数量。
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int T, cas=1;
scanf("%d", &T);
while (T--)
{
char a[40], b[40];
scanf(" %s %s", a+1, b+1);
int la = strlen(a+1);
int lb = strlen(b+1);
long long dp[50][50], ans[50][50];
for (int i = 0; i < 50; i++)
{
for (int j = 0; j < 50; j++)
{
dp[i][j] = 0;
ans[i][j] = 0;
}
}
for (int i = 1; i <= la; i++)
{
dp[i][0] = i;
ans[i][0] = 1;
}
for (int i = 1; i <= lb; i++)
{
dp[0][i] = i;
ans[0][i] = 1;
}
dp[0][0] = 0;
ans[0][0] = 1;
for (int i = 1; i <= la; i++)
{
for (int j = 1; j <= lb; j++)
{
if (a[i]==b[j])
{
dp[i][j] = dp[i-1][j-1]+1;
}
else
{
dp[i][j] = min(dp[i-1][j], dp[i][j-1])+1;
}
if (a[i]==b[j])
{
if (dp[i][j] == dp[i-1][j-1]+1)
ans[i][j] = ans[i-1][j-1];
}
else
{
if (dp[i][j] == dp[i-1][j]+1)
ans[i][j] += ans[i-1][j];
if (dp[i][j] == dp[i][j-1]+1)
ans[i][j] += ans[i][j-1];
}
}
}
printf("Case %d: %lld %lld\n", cas++, dp[la][lb], ans[la][lb]);
}
return 0;
}