HDU 4681 STRING dp+暴力。

题意：不说了很好懂、

这题这么水= =。。。当时竟然没有勇气暴力搜一下。昨天（好吧前天。）比赛的时候胃疼，看到这题想了一个办法就是对每一个出现最短的C串前后连接然后对这个串求最长公共子序列。其实优化一下就是现在的答案啊~~！！！！给赵鹏说了赵鹏说不可能这么过。。然后就没想。就这样这么水的一道题都没过！！！！桑心啊~

代码：

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
using namespace std;
char sa[1005];
char sb[1005];
char sc[1005];
int c[1005][1005];
int d[1005][1005];
struct node
{
    int s,e;
};
int main()
{
    int t;
    //freopen("in.txt","r",stdin);
   // freopen("out1.txt","w",stdout);
   int cas;
   cas = 0;
    scanf("%d",&t);
    while(t--)
    {

        vector<node>vc,vd;
        scanf("%s",sa+1);
        scanf("%s",sb+1);
        scanf("%s",sc+1);

        int len1,len2,len3;
        len1 = strlen(sa+1);
        len2 = strlen(sb+1);
        len3 = strlen(sc+1);
        int i,j;
        memset(c,0,sizeof(c));
        memset(d,0,sizeof(c));

        for(i = 1;i <= len1;i++)
        {
            for(j = 1; j <= len2; j++)
            {
                if(sa[i] == sb[j])
                c[i][j] = c[i-1][j-1]+1;
                else
                c[i][j] = max(c[i-1][j],c[i][j-1]);
            }
        }

        for(i = len1;i>= 1;i--)
        {
            for(j = len2; j >= 1 ; j--)
            {
                if(sa[i] == sb[j])
                d[i][j] = d[i+1][j+1]+1;
                else
                d[i][j] = max(d[i+1][j],d[i][j+1]);
            }
        }

        for(i = 1;i <= len1;i++)
        {
            int cnt;
            cnt = 1;
            if(sa[i] == sc[1])
            {
                for(j = i;j <= len1;j++)
                {
                    if(sa[j] == sc[cnt])
                    cnt++;
                    if(cnt > len3)
                    {
                        struct node tmp;
                        tmp.s = i,tmp.e = j;
                        vc.push_back(tmp);
                        break;
                    }
                }
            }
        }
        for(i = 1;i <= len2;i++)
        {
            int cnt;
            cnt = 1;
            if(sb[i] == sc[1])
            {
                for(j = i;j <= len2;j++)
                {
                    if(sb[j] == sc[cnt])
                        cnt++;
                    if(cnt > len3)
                    {
                        struct node tmp;
                        tmp.s = i;tmp.e = j;
                        vd.push_back(tmp);
                        break;
                    }
                }
            }
        }
       // printf("%d %d
",c[len1][len2],d[1][1]);
        int f,r;
        int ans = 0;
        for(i = 0;i < vc.size();i++)
        {
            for(j= 0;j < vd.size();j++)
            {
                if(vc[i].s == 1||vd[j].s == 1)
                f = 0;
                else f = c[vc[i].s-1][vd[j].s-1];
                if(vc[i].e == len1||vd[j].e == len2)
                r = 0;
                else
                r = d[vc[i].e+1][vd[j].e+1];
                ans = max(ans,f+r+len3);
            }
           // printf("%d****
",i);
        }

        printf("Case #%d: %d
",++cas,ans);
        //cout<<ans<<endl;


    }

    return 0;
}