hdu 5311 Hidden String (dfs)

Problem Description

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".

 

 

Input

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.

 

 

Output

For each test case, output "YES" (without the quotes) if Soda can find such thress substrings, otherwise output "NO" (without the quotes).

 

 

Sample Input

2

annivddfdersewwefary

nniversarya

 

 

Sample Output

YES

NO

 

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s1[20]={"anniversary"};
char s2[111];
int pos,ll;
void dfs(int x,int y,int k)
{
    if (k<=3&&y>=11)
    {
        pos=1;
        return ;
    }
    int i,z;
    if (pos||k>3||x>=ll) return ;
    for (i=x;i<ll;i++)
    {
        if (s2[i]!=s1[y]) continue;
        x=i;
        z=y;
        while (s2[x]==s1[z]&&x<ll&&z<11)
        {
            z++;
            x++;
        }
        dfs(x,z,k+1);
    }
}
int main()
{
    int t,i,j;
    scanf("%d",&t);
    getchar();
    while (t--)
    {
        scanf("%s",&s2);
        ll=strlen(s2);
        pos=0;
        dfs(0,0,0);
        if (pos) printf("YES\n");
        else printf("NO\n");
    }
}