tjut 4681

来源：互联网发布：芳纶纸淘宝编辑：程序博客网时间：2024/05/29 15:03
#include <iostream>  #include <cstring>  #include <cstdio>  #include <cstdlib>  #include <cmath>  #include <vector>  #include <queue>  #include <set>  #include <map>  #include <stack>  #define LL long long  using namespace std;  const int MAXN = 1000 + 10;  char s1[MAXN], s2[MAXN], s3[MAXN];  int dp1[MAXN][MAXN], dp2[MAXN][MAXN];  int left1[MAXN], right1[MAXN], left2[MAXN], right2[MAXN];  int main()  {      int T, kcase = 1;      scanf("%d", &T);      while(T--)      {          scanf("%s%s%s", &s1, &s2, &s3);          memset(dp1, 0, sizeof(dp1));          memset(dp2, 0, sizeof(dp2));          int len1 = strlen(s1), len2 = strlen(s2), len3 = strlen(s3);          for(int i=1;i<=len1;i++)          {              for(int j=1;j<=len2;j++)              {                  if(s1[i-1] == s2[j-1])                      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=len1-1;i>=0;i--)          {              for(int j=len2-1;j>=0;j--)              {                  if(s1[i] == s2[j])                      dp2[i][j] = dp2[i+1][j+1] + 1;                  else dp2[i][j] = max(dp2[i+1][j], dp2[i][j+1]);              }          }          int m1 = 0;          for(int i=0;i<len1;i++)          {              int k = 0;              if(s1[i] == s3[k])              {                  for(int j=i;j<len1;j++)                  {                      if(s1[j] == s3[k])                      {                          k++;                          if(k == len3)                          {                              left1[m1] = i;                              right1[m1++] = j;                              break;                          }                      }                  }              }          }          int m2 = 0;          for(int i=0;i<len2;i++)          {              int k = 0;              if(s2[i] == s3[k])              {                  for(int j=i;j<len2;j++)                  {                      if(s2[j] == s3[k])                      {                          k++;                          if(k == len3)                          {                              left2[m2] = i;                              right2[m2++] = j;                              break;                          }                      }                  }              }          }          int ans = 0;          for(int i=0;i<m1;i++)          {              for(int j=0;j<m2;j++)              {                  ans = max(ans, dp1[left1[i]][left2[j]] + len3 + dp2[right1[i]+1][right2[j]+1]);              }          }          printf("Case #%d: %d\n",kcase++, ans);      }      return 0;;  }
0 0