题目:
题解:
KMP乱搞?特判?好麻烦的样子
真的没想到FFT还可以解决字符串问题,脑洞题。
构造卷积
ai=si
a
i
=
s
i
bi=ti ti≠?
b
i
=
t
i
t
i
≠
?
bi=0 ti=?
b
i
=
0
t
i
=
?
我们把b数组倒过来,不难写出
当 ci c i 为0的时候,表示小串的结尾怼在这一位,匹配成功
我们把这个柿子展开一下就会发现ta是由两项卷积+常数组成的,分别求就好咯
我们再重申一下原则:FFT用来加速求卷积
如果卷积的变量是序列x(n)和h(n),则卷积的结果
(*表示卷积)
注意因为a的范围达到n,必须在求下一次卷积之前memset!
代码:
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
const double pi=acos(-1.0);
const int N=300005;
struct complex
{
double x,y;
complex(double X=0,double Y=0){x=X;y=Y;}
}a[N],b[N];int n,sn,sm,r[N],x[N],y[N],ans[N],c[N];char S[N],T[N];
complex operator +(complex a,complex b){return complex(a.x+b.x,a.y+b.y);}
complex operator -(complex a,complex b){return complex(a.x-b.x,a.y-b.y);}
complex operator *(complex a,complex b){return complex(a.x*b.x-a.y*b.y,a.y*b.x+a.x*b.y);}
void FFT(complex *a,int id)
{
for (int i=0;i<n;i++)
if (i<r[i]) swap(a[i],a[r[i]]);
for (int k=1;k<n;k<<=1)
{
complex wn=complex(cos(pi/k),id*sin(pi/k));
for (int i=0;i<n;i+=(k<<1))
{
complex w=complex(1,0);
for (int j=0;j<k;j++,w=w*wn)
{
complex x=a[i+j],y=w*a[i+j+k];
a[i+j]=x+y; a[i+j+k]=x-y;
}
}
}
}
int main()
{
scanf("%s",S);scanf("%s",T);
sn=strlen(S);sm=strlen(T);
for (int i=0;i<sn;i++) x[i]=S[i]-'a'+1;
for (int i=0;i<sm;i++) y[i]= (T[sm-i-1]=='?')?0:T[sm-i-1]-'a'+1;
int L=0;
for (n=1;n<=sn+sm;n<<=1) L++;
for (int i=0;i<n;i++)
r[i]=(r[i>>1]>>1) | ((i&1)<<L-1);
for (int i=0;i<sn;i++) a[i].x=x[i]*x[i];
for (int i=0;i<sm;i++) b[i].x=y[i];
FFT(a,1); FFT(b,1);
for (int i=0;i<n;i++) a[i]=a[i]*b[i];
FFT(a,-1);
for (int i=0;i<n;i++) c[i]+=(int)(a[i].x/n+0.5);
memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); ///
for (int i=0;i<sn;i++) a[i].x=2*x[i];
for (int i=0;i<sm;i++) b[i].x=y[i]*y[i];
FFT(a,1); FFT(b,1);
for (int i=0;i<n;i++) a[i]=a[i]*b[i];
FFT(a,-1);
for (int i=0;i<n;i++) c[i]-=(int)(a[i].x/n+0.5);
double z=0;
for (int i=0;i<sm;i++) z+=y[i]*y[i]*y[i];
for (int i=sm-1;i<sn;i++)
if (c[i]+(int)z<0.5) ans[++ans[0]]=i-sm+1;
printf("%d\n",ans[0]);
for (int i=1;i<=ans[0];i++) printf("%d\n",ans[i]);
}