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

#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

PKU 1925最长下降子序列

2009年02月11日 849B 下载

子串和子序列并不是一个意思

2015-11-21 13:10:56

最长上升子序列的两种算法

2016-08-11 21:21:00

每天一道LeetCode-----找出给定序列的所有子序列

2017-12-10 19:35:21

java实现求一个数组中有多少个子序列

2017-05-25 17:24:59

最长不下降子序列（可以改成最长上升子序列）

2016-07-29 17:26:08

最小最序列和以及最小正子序列

2013-05-03 23:15:22

最长上升子序列的两种方法

2016-04-25 21:56:54

最长上升子序列、最长下降子序列的DP算法由O(n^2)到O(nlogn)算法

2015-08-25 17:56:44

求取任意字符串的所有子序列

2017-03-24 16:55:44