BestCoder Round #48 ($)HDU5284 wyh2000 and a string problem

wyh2000 and a string problem

                                          Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
                                                                   Total Submission(s): 789    Accepted Submission(s): 378

Problem Description

Young theoretical computer scientist wyh2000 is teaching young pupils some basic concepts about strings.

A subsequence of a string  s  is a string that can be derived from  s  by deleting some characters without changing the order of the remaining characters. You can delete all the characters or none, or only some of the characters.

He also teaches the pupils how to determine if a string is a subsequence of another string. For example, when you are asked to judge whether  wyh  is a subsequence of some string or not, you just need to find a character  w , a  y , and an  h , so that the  w  is in front of the  y , and the  y  is in front of the  h .

One day a pupil holding a string asks him, "Is  wyh  a subsequence of this string?"
However, wyh2000 has severe myopia. If there are two or more consecutive character  v s, then he would see it as one  w . For example, the string  vvv  will be seen as  w , the string  vvwvvv  will be seen as  www , and the string  vwvv  will be seen as  vww .

How would wyh2000 answer this question?

 

Input

The first line of the input contains an integer  T(T≤105) , denoting the number of testcases.

N  lines follow, each line contains a string.

Total string length will not exceed 3145728. Strings contain only lowercase letters.

The length of hack input must be no more than 100000.

 

Output

For each string, you should output one line containing one word. Output  Yes  if wyh2000 would consider  wyh  as a subsequence of it, or  No  otherwise.

 

Sample Input

  
  

   
   4
woshiyangli
woyeshiyangli
vvuuyeh
vuvuyeh
  
  

 

Sample Output

  
  

   
   No
Yes
Yes
No
  
  

 

Source

BestCoder Round #48 ($)

出题人：本题是一道送分的字符串题。这里给出两种解法。

1：维护一个类似栈的结构，存储wyh2000实际看到的字符串。扫描整个字符串，每看到两个相邻的

$\text{v}就往栈中加入一个$$\text{w}$；否则看到什么就加入什么。最后扫一遍看$\text{wyh}$是不是栈中元素组成的串的子序列即可。

2：我们寻找一个$i$，使得s_i=\text{v}s​i​​=v且s_{i+1}=\text{v}s​i+1​​=v并且$i$尽量小。然后我们寻找一个$j$，使得s_j=\text{w}s​j​​=w且$j$尽量小。

我们再寻找一个$k$，使得s​k​​=y,min(i+1,j)<k且$k$尽量小。然后我们寻找一个$l$，使得s_l=\text{h},k<ls​l​​=h,k<l。

如果我们能找到符合条件的$i,k,l$或符合条件的$j,k,l$，那么答案就是$\text{Yes}$，否则答案就是$\text{No}$。

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
using namespace std;
char a[3146728];
int main()
{
    int t,l,i,j,flag;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s",a);
        flag=0;
        l=strlen(a);
        for(i=0;i