本文共 1455 字，大约阅读时间需要 4 分钟。

Description

You have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in detail how the strings are generated and inserted into the original message. To validate your method, however, it is necessary to write a program that checks if the message is really encoded in the final string.

Given two strings s and t, you have to decide whether s is a subsequence of t, i.e. if you can remove characters from t such that the concatenation of the remaining characters is s.

The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII characters separated by whitespace.The length of s and t will no more than 100000.

For each test case output “Yes”, if s is a subsequence of t,otherwise output “No”.

sequence subsequence

Yes

给两个串，判断第一个串是不是第二个串的子序列

#include 
   
    #include 
    
     #include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           #include 
           
            #define INF 0x3f3f3f3f#define MAXN 100005#define Mod 10001using namespace std;int main(){ char s[MAXN],t[MAXN]; while(cin>>s>>t) { int i,j; for(i=0,j=0;t[j]!='\0';++j) if(s[i]==t[j]) i++; if(s[i]=='\0') printf("Yes\n"); else printf("No\n"); } return 0;}
           
          
         
        
       
      
     
    
   

转载地址：http://dxcvb.baihongyu.com/