UVA10340 子序列 All in All

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

int main() {
    string s, t;
    while (cin >> s >> t) {
        int j = 0;
        for (int i = 0; i < sz(s); i++) {
            if (i) j++;
            while (j < sz(t) && t[j] != s[i]) j++;
        }
        cout << (j < sz(t) ? "Yes" : "No") << endl;
    }
    return 0;
}