Combine String---hdu5727 &&& Zipper（LCS变形）

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <map>
using namespace std;
#define N 1010
#define met(a, b) memset(a, b, sizeof(a))
#define INF 0x3f3f3f3f
#define LINF 10e16
typedef long long LL;

int dp[N][N];

int main()
{
    char a[N], b[N], c[N];
    int T, t = 1;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%s %s %s", a+1, b+1, c+1);

        printf("Data set %d: ", t++);

        met(dp, 0);

        int L1 = strlen(a+1), L2 = strlen(b+1), L3 = strlen(c+1);

        if(L1+L2 != L3)
        {
            puts("no");
            continue;
        }

        dp[0][0] = 1;

        for(int i=0; i<=L1; i++)
        {
            for(int j=0; j<=L2; j++)
            {
                if(i==0 && j==0)continue;

                if(c[i+j] == a[i] && c[i+j] == b[j])
                    dp[i][j] = dp[i-1][j] || dp[i][j-1];
                else if(c[i+j] == a[i])
                {
                    if(i == 0) dp[i][j] = 1;
                    else dp[i][j] = dp[i-1][j];
                }
                else if(c[i+j] == b[j])
                {
                    if(j == 0) dp[i][j] = 1;
                    else dp[i][j] = dp[i][j-1];
                }
            }
        }
        if(dp[L1][L2]) puts("yes");
        else puts("no");
    }
    return 0;
}