HDU 1501 Zipper(DFS)
2012-07-29 10:29
525 查看
题目链接
不加记忆化 搜索 TLE,加上15ms.....
不加记忆化 搜索 TLE,加上15ms.....
#include <stdio.h> #include <string.h> char str1[201],str2[201],str3[402]; int p[201][201]; int z,len; void dfs(int a,int b,int x) { if(z) return ; if(p[a][b]) return ; p[a][b] = 1; if(x > len-1) { z = 1; return ; } if(str1[a] == str3[x]) { dfs(a+1,b,x+1); } if(str2[b] == str3[x]) { dfs(a,b+1,x+1); } } int main() { int num = 0,t; scanf("%d%*c",&t); while(t--) { scanf("%s%s%s",str1,str2,str3); memset(p,0,sizeof(p)); num ++; len = strlen(str3); z = 0; dfs(0,0,0); printf("Data set %d: ",num); if(z) printf("yes\n"); else printf("no\n"); } return 0; }
相关文章推荐
- HDU 1501 Zipper(DFS)
- (step4.3.5)hdu 1501(Zipper——DFS)
- Hdu 1501 Zipper【dfs】
- Zipper(HDU 1501) —— DFS
- HDU 1501 Zipper(Dfs记忆化搜索)
- hdu 1501 Zipper(记忆化DFS)
- hdu 1501 Zipper (dfs+记忆化搜索)
- HDU 1501 Zipper(DFS)
- HDU 1501 Zipper 【DFS】
- HDU 1501 Zipper(DP,DFS)
- hdu 1501 Zipper(dfs)
- HDU 1501 Zipper(DFS)
- hdu 1501 Zipper(dfs或dp)
- HDU 1501 Zipper 【DFS+剪枝】
- hdu 1501 Zipper(DFS)
- HDU 1501 Zipper(DP,DFS)
- HDU1501 Zipper(DFS+记忆化搜索)
- HDU-1501 (POJ-2192) Zipper (DFS||DP)
- HDU 1501 Zipper(dfs)
- (step4.3.5)hdu 1501(Zipper——DFS)