POJ1936-All-in-All（子序列）

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. 

Input

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.

Output

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

Sample Input

sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter

Sample Output

Yes
No
Yes
No

题意：输入的2个字符串，后者字符要包含前者字符，并且顺序是正确的。比如测试数据2，后者字符串包含前者字符串的所有内容，但字符串1并不是字符串2的子序列。

代码如下：

#include 
   
   
    
    
#include 
    
    
     
     
using namespace std;
char a[100000],b[100000];
int main()
{
	int len1,len2,flag,cnt;
	while(scanf("%s%s",a,b)!=EOF)
	{
		if(strstr(b,a)) {printf("Yes\n");continue;}
		len1=strlen(a);len2=strlen(b);
		//第一次提交时还将数组长度和数组排序 将长的数组排后面
		//然后一直没能AC（其实好像如果排对了应该能AC），删了排序步骤就AC了
		//此题只需判断前一字符串是后一字符串的子字符串就可以了（是自己想多了= =）
		cnt=0;
		for(int i=0;i
     
     
    
    
   
   

学会使用strcpy()  strstr() 等；

博客已搬：洪学林博客