题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4681
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define fi first
#define se second
const int N = 1111;
char a[N], b[N], c[N];
int dp1[N][N], dp2[N][N], lena, lenb, lenc;
pair<int, int> pos[2][N];
void LCS()
{
for(int i=1; i<=lena; i++) {
for(int j=1; j<=lenb; j++) {
if(a[i] == b[j]) dp1[i][j] = dp1[i-1][j-1] + 1;
else dp1[i][j] = max(dp1[i-1][j], dp1[i][j-1]);
}
}
for(int i=lena; i>0; i--) {
for(int j=lenb; j>0; j--) {
if(a[i] == b[j]) dp2[i][j] = dp2[i+1][j+1] + 1;
else dp2[i][j] = max(dp2[i][j+1], dp2[i+1][j]);
}
}
}
void findc(char str[], int &len, int n, int &num)
{
int i, j, k;
for(i=1; i<=len; i++) {
if(str[i] == c[1]) {
for(j=i+1, k=2; j<=len && k<=lenc; j++) {
if(str[j] == c[k]) k++;
if(k == lenc+1) break;
}
if(k == lenc+1) {
pos[n][num].fi = i;
pos[n][num].se = j;
num++;
}
else break;
}
}
}
int main()
{
int t;
scanf("%d", &t);
getchar();
for(int cases=1; cases<=t; cases++) {
gets(a+1), lena = strlen(a+1);
gets(b+1), lenb = strlen(b+1);
gets(c+1), lenc = strlen(c+1);
memset(dp1, 0, sizeof(dp1));
memset(dp2, 0, sizeof(dp2));
LCS();
int anum = 0, bnum = 0;
findc(a, lena, 0, anum);
findc(b, lenb, 1, bnum);
int ans = 0;
for(int i=0; i<anum; i++) {
for(int j=0; j<bnum; j++) {
ans = max(ans, dp1[pos[0][i].fi-1][pos[1][j].fi-1]
+ dp2[pos[0][i].se+1][pos[1][j].se+1]);
}
}
printf("Case #%d: %d\n", cases, ans+lenc);
}
return 0;
}