UVa - 10340 - All in All(暴力遍历、子序列)

 

#include<cstdio>
#include<cstring>
using namespace std;
char s1[101000];
char s2[101000];

int main(){

//	freopen("input.txt","r",stdin);

	while(scanf("%s %s",s1,s2)!=EOF){
		int len1 = strlen(s1);
		int len2 = strlen(s2);
		int x = 0;
		int j = 0;
		int i = 0;
		int flag = 0;
		
		
		for(i=0 ;i<len1 ;i++){
			for(j=x ;j<len2 ;j++){
				if(s1[i]==s2[j]){
					x = j+1;
					break;
				}
			}
			
			if(j==len2){
				flag = 1;
				break;
			}
			
		}
	
		if(flag){
			printf("No\n");
		}else{
			printf("Yes\n");
		}
	}
	return 0;
}