月月查华华的手机

https://ac.nowcoder.com/acm/contest/392/J

总结：序列自动机；

nex[i][j]表示位置i的字符j在i后第一次在哪里出现；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=1e6+9;
const int maxm=5e6+9;
const int mod=1e9+7;

int nex[maxn][30];


char s[maxn],t[maxn];

int main()
{
    //FAST_IO;

    int n,m;
    //cin>>n>>m;
    sfs(s+1);
    n=strlen(s+1);

    for(int i=n;i>=1;i--)
    {
        for(int j=0;j<26;j++)
        {
            nex[i-1][j]=nex[i][j];
        }
        nex[i-1][s[i]-'a']=i;
    }
    int q;
    cin>>q;
    while(q--)
    {
        sfs(t+1);
        int len=strlen(t+1);
        bool f=1;
        int now=0;//0存了s最近的所以字符位置
        for(int i=1;i<=len;i++)
        {
            now=nex[now][t[i]-'a'];
            if(now==0)
            {
                f=0;
                break;
            }
        }
        if(f) puts("Yes");
        else puts("No");
    }


    return 0;
}