仿着两个字符串的LCS写就是了。
[code]:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s[3][55];
int dp[55][55][55],len[3];
int main(){
int i,j,k,cas,T;
scanf("%d",&cas);
for(T = 1;T <= cas;T++){
for(i = 0;i < 3;i++){
scanf("%s",s[i]+1);
len[i] = strlen(s[i]+1);
}
memset(dp,0,sizeof(dp));
for(i = 1;i <= len[0];i++)
for(j = 1;j <= len[1];j++)
for(k = 1;k <= len[2];k++){
if(s[0][i]==s[1][j]&&s[1][j]==s[2][k]){
dp[i][j][k] = dp[i-1][j-1][k-1]+1;
//printf("-> %d %d\n",dp[i][j][k],dp[i-1][j-1][k-1]);
}
dp[i][j][k] = max(max(dp[i][j][k],dp[i-1][j][k]),max(dp[i][j-1][k],dp[i][j][k-1]));
//printf("%d %d %d %d %c%c%c\n",i,j,k,dp[i][j][k],s[0][i],s[1][j],s[2][k]);
}
printf("Case %d: %d\n",T,dp[len[0]][len[1]][len[2]]);
}
return 0;
}