UVA——10340

问题描述：

You have devised a new encryption technique which encodes a message by inserting between its charac-
ters 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. Input is terminated by EOF.
Output
For each test case output, if s is a subsequence of t.
Sample Input
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Sample Output
Yes
No
Yes
No

解决代码：

#include <iostream>
#include <cstdio>
#include <cstring>
char str[100000],substr[100000];
int main()
{

    while(scanf("%s",substr) !=EOF){
        scanf("%s",str);
        int i = 0,j = 0;
        while(str[i]){
            if(str[i] == substr[j])
                j++;
            i++;
        }
        if(!substr[j])
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}

核心思路：数组设置的大一点