013:Zipper

思路：
动态规划

dp[i][j] = 用s1的前i个字符和s2的前j个字符，能否形成s3的前i+j个字符
（字符串的下标从1开始）

边界条件：
dp[0][0] = 1;
dp[i][0] = (s1[i]==s3[i])(1<=i<=s1.length()-1);
dp[0][j] = (s1[j]==s3[j])(1<=j<=s2.length()-1);

递推公式：
当s1[i]==s3[i+j]时：
p[i][j] = max(dp[i - 1][j], dp[i][j]);
当s2[j]==s3[i+j]时：
dp[i][j] = max(dp[i][j - 1], dp[i][j]);

递推过程：

由此可知dp数组应按i从小到达，j从小到大的顺序生成

#include <cstdio>
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;

int n;
string s1, s2, s3;
int dp[300][300];
int main() {
	cin >> n;
	int k = n;
	while (n--) {
		cin >> s1 >> s2 >> s3;
		//处理下标，从1开始
		s1 = ' ' + s1;
		s2 = ' ' + s2;
		s3 = ' ' + s3;
		//初始化dp数组
		int i, j;
		for (i = 0; i <= s1.length() - 1; i++) {
			for (j = 0; j <= s2.length() - 1; j++) {
				dp[i][j] = 0;
			}
		}
		//边界情况
		
		dp[0][0] = 1;
		for (i = 1; i <= s1.length() - 1; i++) {
			dp[i][0] = (s1[i] == s3[i]);
		}
		for (j = 1; j <= s2.length() - 1; j++) {
			dp[0][j] = (s2[j] == s3[j]);
		}
		//生成记忆数组
		for (i = 1; i <= s1.length() - 1; i++) {
			for (j = 1; j <= s2.length() - 1; j++) {
				//如果是s1[i]为结尾的情况
				if (s1[i] == s3[i + j]) {
					dp[i][j] = max(dp[i - 1][j], dp[i][j]);
				}
				//如果是s2[j]为结尾的情况
				if (s2[j] == s3[i + j]) {
					dp[i][j] = max(dp[i][j - 1], dp[i][j]);
				}
			}
		}
		cout <<"Data set "<<k-n<<": " ;

		if (dp[s1.length() - 1][s2.length() - 1]==1) {
			cout << "yes" << endl;
		}
		else {
			cout << "no" << endl;
		}
	}
	return 0;
}