题目连接

题面:

代码:

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<vector>
#define ll long long
#define llu unsigned ll
using namespace std;
const int mod=998244353;
const int maxn=1001000;
char a[maxn],b[maxn];
int nt[maxn],f[maxn];

void kmp(int n,int m)
{
    nt[1]=0;
    for(int i=2,j=0;i<=n;i++)
    {
        while(j>0&&a[i]!=a[j+1]) j=nt[j];
        if(a[i]==a[j+1]) j++;
        nt[i]=j;
    }

    for(int i=1,j=0;i<=m;i++)
    {
        while(j>0&&(j==n||b[i]!=a[j+1])) j=nt[j];
        if(b[i]==a[j+1]) j++;
        f[i]=j;
        if(f[i]==n) printf("%d\n",i-n+1);
    }
    for(int i=1;i<=n;i++)
        printf("%d ",nt[i]);
}

int main(void)
{
    scanf("%s%s",b+1,a+1);
    int n=strlen(a+1);
    int m=strlen(b+1);
    kmp(n,m);
    return 0;
}