【BZOJ 3942】 Censoring

【题目链接】

https://www.lydsy.com/JudgeOnline/problem.php?id=3942

【算法】

栈 + KMP

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXN 1000010
 
int i,pos,top,ls,lt;
int nxt[MAXN],p[MAXN];
char S[MAXN],T[MAXN],ans[MAXN];
int stk[MAXN];
 
int main()
{
 
        scanf("%s%s",S+,T+);
        ls = strlen(S+);
        lt = strlen(T+);
        for (i = ; i <= lt; i++)
        {
                pos = nxt[i-];
                while (pos && T[pos+] != T[i]) pos = nxt[pos];
                if (T[pos+] == T[i]) pos++;
                nxt[i] = pos;
        }
        for (i = ; i <= ls; i++)
        {
                if (!top)
                {
                        if (S[i] == T[]) stk[++top] = ;
                        else stk[++top] = ;
                        p[top] = i;
                } else
                {
                        pos = stk[top];
                        while (pos && T[pos+] != S[i]) pos = nxt[pos];
                        if (T[pos+] == S[i]) pos++;
                        stk[++top] = pos;
                        p[top] = i;
                        if (pos == lt) top -= lt;
                }
        }
        for (i = ; i <= top; i++) putchar(S[p[i]]);
        printf("\n");
 
        return ;
 
}