方法一:
#include <cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstdlib>
#define LL long long
#define bug puts("***********")
#define INF 0x3f3f3f3f
using namespace std;
char s1[1010],s2[1010],s3[1010];
int dp[1010][1010];
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int cas=1; cas<=n; cas++)
{
memset(dp,0,sizeof(dp));
scanf("%s%s%s",s1+1,s2+1,s3+1);
int len1=strlen(s1+1),len2=strlen(s2+1),len3=strlen(s3+1);
if(len1+len2!=len3)
printf("Data set %d: no\n",cas);
else
{
for(int i=0; i<=len1; i++)
{
for(int j=0; j<=len2; j++)
{
if(s1[i]==s3[i+j]&&i>0)
dp[i][j]=max(dp[i-1][j]+1,dp[i][j]);
if(s2[j]==s3[i+j]&&j>0)
dp[i][j]=max(dp[i][j-1]+1,dp[i][j]);
}
}
if(dp[len1][len2]==len3)
printf("Data set %d: yes\n",cas);
else
printf("Data set %d: no\n",cas);
}
}
}
return 0;
}
方法二:
#include<vector>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<stack>
using namespace std;
const int maxn = 1200;
char q[maxn],p[maxn],s[maxn*2];
bool dp[maxn][maxn];
int main(){
scanf("%s %s %s",p+1,q+1,s+1);
int n = strlen(p+1),m = strlen(q+1);
memset(dp,0,sizeof(dp));
dp[0][0] = true;
for(int i=1;i<=n;i++) dp[i][0] = dp[i-1][0] && p[i]==s[i];
for(int i=1;i<=m;i++) dp[0][i] = dp[0][i-1] && q[i]==s[i];
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
dp[i][j] = (dp[i-1][j] && p[i]==s[i+j]) || (dp[i][j-1] && q[j]==s[i+j]);
}
}
puts(dp[n][m]?"Yes":"No");
return 0;
}