2/19 kmp算法+dfs+记忆化搜索+图的遍历+层次拓扑

P3375 【模板】KMP字符串匹配 https://www.luogu.com.cn/problem/P3375

#include 

using namespace std;
const int maxn=1e6+5;
char s1[maxn],s2[maxn];
int n,m,p[maxn];
void pre()
{
    p[1]=0;int j=0;
    for(int i=1;i0&&s2[j+1]!=s2[i+1])
            j=p[j];
        if(s2[j+1]==s2[i+1])
            j++;
        p[i+1]=j;
    }
}
void kmp()
{
    int ans=0,j=0;
    for(int i=0;i0&&s2[j+1]!=s1[i+1])
            j=p[j];
        if(s2[j+1]==s1[i+1]) j++;
        if(j==m)
        {
            printf("%d\n",i+2-m);
            j=p[j];
        }
    }
}
int main()
{
    scanf("%s",s1+1);scanf("%s",s2+1);
    n=strlen(s1+1);
    m=strlen(s2+1);
    //cout