看到这道题我第一时间就想到用深搜,一开始我的思路是从头开始递归的,但是始终是TLE,后来百度一下看见某位大牛说要从后面开始递归才能AC,后来就改了,至于为什么要从后面开始递归才能AC,由于本人水平有限,这里无法解释。
// Problem#: 1010
// Submission#: 1216733
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include<iostream>
#include<string>
#include<cstring>
#include<stack>
using namespace std;
string a,b,c;
int dp(int a1,int b1,int c1)
{
if(c1==-1) return 1;
if(a1>=0&&a[a1]==c[c1]&&dp(a1-1,b1,c1-1))
return 1;
if(b1>=0&&b[b1]==c[c1]&&dp(a1,b1-1,c1-1))
return 1;
return 0;
}
int main()
{
int t;
cin>>t;
int num=1;
while(t--)
{
cin>>a>>b>>c;
if(dp(a.size()-1,b.size()-1,c.size()-1))
cout<<"Data set "<<num++<<": yes"<<endl;
else
cout<<"Data set "<<num++<<": no"<<endl;
}
return 0;
}