题目链接:点击打开链接
题目大意:给出两个字符串,求同时包含这两个串的最短字符串及个数。
例如:
USA
USSR
显然所求长度就是两字符串长度之和减去最长公共子串长度为5,个数为3:
USASR USSAR USSRA
解题思路:
dp,令num[i][j]为包含字符串A的前i个字符和字符串B的前j个字符的最短串个数。
A[i] == B[j] 时,num[i][j] = num[i-1][j-1];
否则讨论剩余两种情况。
附上代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
char a[50];
char b[50];
ll len[50][50];
ll num[50][50];
int lena, lenb;
ll solve()
{
for (int i = 0; i <= lena; i++)
{
len[i][0] = i;
num[i][0] = 1;
}
for (int j = 0; j <= lenb; j++)
{
len[0][j] = j;
num[0][j] = 1;
}
for(int i = 1; i<=lena; i++)
for (int j = 1; j <= lenb; j++)
{
if (a[i] == b[j])
len[i][j] = len[i - 1][j - 1] + 1, num[i][j] += num[i - 1][j - 1];
else
{
len[i][j] = min(len[i - 1][j], len[i][j - 1]) + 1;
if (len[i - 1][j] <= len[i][j - 1]) num[i][j] += num[i - 1][j];
if (len[i][j - 1] <= len[i - 1][j]) num[i][j] += num[i][j - 1];
}
}
return num[lena][lenb];
}
int main()
{
int test;
scanf("%d", &test);
for (int cas = 1; cas <= test; cas++)
{
scanf("%s%s", a+1, b+1);
memset(num, 0, sizeof(num));
memset(len, 0, sizeof(len));
lena = strlen(a+1);
lenb = strlen(b+1);
solve();
printf("Case %d: %lld %lld\n", cas, len[lena][lenb], num[lena][lenb]);
}
return 0;
}