hdoj--1034--Hidden String(dfs)
2015-12-06 14:11
344 查看
Hidden String
[align=center]Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1677 Accepted Submission(s): 589
[/align]
[align=left]Problem Description[/align]
Today is the 1st anniversary of BestCoder. Soda, the contest manager, gets a string
s
of length n.
He wants to find three nonoverlapping substrings s[l1..r1],
s[l2..r2],
s[l3..r3]
that:
1. 1≤l1≤r1<l2≤r2<l3≤r3≤n
2. The concatenation of s[l1..r1],
s[l2..r2],
s[l3..r3]
is "anniversary".
[align=left]Input[/align]
There are multiple test cases. The first line of input contains an integer
T
(1≤T≤100),
indicating the number of test cases. For each test case:
There's a line containing a string s
(1≤|s|≤100)
consisting of lowercase English letters.
[align=left]Output[/align]
For each test case, output "YES" (without the quotes) if Soda can find such thress substrings, otherwise output "NO" (without the quotes).
[align=left]Sample Input[/align]
2
annivddfdersewwefary
nniversarya
[align=left]Sample Output[/align]
YES
NO
[align=left]Source[/align]
BestCoder 1st Anniversary ($)
[align=left]Recommend[/align]
hujie | We have carefully selected several similar problems for you: 5594 5593 5592 5591 5590
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; char str[1010],op[13]={"anniversary"}; int flog,l,L; void dfs(int b1,int b2,int num) { int i; if(b2>=11&&num<=3) { flog=1; return ; } if(num>3) return ; if(b1>=l||flog) return ; for(i=b1;i<l;i++) { int x=i; int y=b2; while(str[x]==op[y]&&x<l&&y<11) { x++,y++; } dfs(x+1,y,num+1); } } int main() { int t; scanf("%d",&t); while(t--) { L=strlen(op); memset(str,'\0',sizeof(str)); scanf("%s",str); flog=0; l=strlen(str); dfs(0,0,0); if(flog) printf("YES\n"); else printf("NO\n"); } return 0; }
相关文章推荐
- hadoop学习008
- hibernate注解
- 编程基础知识之复数类型
- ios实现倒计时的两种方法
- 在Word简历中插入照片(图片)
- hdoj--1034--Hidden String(dfs)
- 有向图(4)--基于深度优先的拓扑排序
- [UVA 10441]Catenyms[欧拉路]
- 基于Wolf32F031 自由评估板的KEY scan(查询方式)实验硬件原理及软件API使用方法(适用于STM32F030/031)
- 深搜与广搜
- 解决RecyclerView中使用UIL加载网络图片,在刷新时出现闪烁问题
- CPP之中介者设计模式
- SpringMVC前端传值到Controller与Controller中传值到View解析
- 在U盘上安装ChromiumOS
- HDOJ 5311-Hidden String【深搜】
- dedecms标签
- js对象的创建和继承
- 基于Wolf32F031 自由评估板的LED Control实验硬件原理及软件API使用方法(适用于STM32F030/031)
- 带你走进ajax(4)
- 带你走进ajax(4)