推荐一篇好的博客:https://blog.csdn.net/qq_38891827/article/details/80281151
一下部分内容转自上面那篇博客。
上面那位朋友说,FFT主要解决两类问题,一类是特殊要求的字符串匹配可构造卷积FFT的,另一类是对两个数组n^2的加法的所有可能结果进行加速。
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define maxn 400005//开四倍所有数组。
const double pi=acos(-1.0);
struct complex
{
double x,y;
complex(double X=0,double Y=0)
{
x=X,y=Y;
}
} a[maxn],b[maxn];
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.x*b.y+a.y*b.x);
}
int S,T,n,m,L,R[maxn],ans[maxn];
long long F[maxn];//存储多项式相乘结果的系数从0-n
double f[maxn],g[maxn];
void FFT(complex a[maxn],int opt)
{
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),opt*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;
}
}
}
}
void calc(int opt)
{
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)//上限为n,在运用时灵活修改。
F[i]=(long long)(a[i].x/n+0.5)*opt;
}
void solve()
{
/*
多项式f和多项式g的乘积
其中,多项式f的次数为0到S,多项式g的次数为0到T
结果存在数组F中,F的系数为0到S+T
时间:O(n logn)
*/
m=S+T;
L=0;//多组输入时,L要初始化为0
for (n=1; n<=m; 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<=n; ++i)
a[i]=complex(1.0*f[i],0.0),b[i]=complex(1.0*g[i],0.0);
calc(1);
}
int main()
{
scanf("%d%d",&S,&T);
for(int i=0; i<=S; i++)
scanf("%lf",&f[i]);
for(int i=0; i<=T; i++)
scanf("%lf",&g[i]);
solve();
for(int i=0; i<=S+T; i++)
printf("%d ",F[i]);
return 0;
}
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define mem(a,b) memset((a),b,sizeof(a))
typedef long long ll;
const ll inf=1e18;
const int maxn=4000010;
using namespace std;
char aa[1000010],bb[1000010];
const double pi=acos(-1.0);
struct complex
{
double x,y;
complex(double X=0,double Y=0)
{
x=X,y=Y;
}
} a[maxn],b[maxn];
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.x*b.y+a.y*b.x);
}
int S,T,n,m,L,R[maxn];
int F[maxn],FF[maxn];//存储多项式相乘结果的系数从0-n
double f[maxn],g[maxn];
void FFT(complex a[maxn],int opt)
{
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),opt*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;
}
}
}
}
void calc(int opt)
{
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)//上限为n,在运用时灵活修改。
F[i]=(long long)(a[i].x/n+0.5)*opt;
}
void solve()
{
/*
多项式f和多项式g的乘积
其中,多项式f的系数为0到S,多项式g的系数为0到T
结果存在数组F中,F的系数为0到S+T
时间:O(n logn)
*/
m=S+T;
for (n=1; n<=m; 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<=n; ++i)
a[i]=complex(1.0*f[i],0.0),b[i]=complex(1.0*g[i],0.0);
calc(1);
}
int main()
{
scanf("%s",aa);
scanf("%s",bb);
int lena=strlen(aa),lenb=strlen(bb);
int ans=0;
mem(FF,0);
//S P L
L=0;
mem(f,0);mem(g,0);
for(int i=0;i<lena;i++)
{
if(aa[i]=='P'||aa[i]=='L')
f[i]=1;
else
f[i]=0;
}
for(int i=0;i<lenb;i++)
{
if(bb[i]=='S')
g[lenb-i-1]=1;
else
g[lenb-i-1]=0;
}
S=lena-1;
T=lenb-1;
solve();
for(int i=0;i<=S+T;i++)
FF[i]+=F[i];
//P R K
L=0;
mem(f,0);mem(g,0);
for(int i=0;i<lena;i++)
{
if(aa[i]=='R'||aa[i]=='K')
f[i]=1;
else
f[i]=0;
}
for(int i=0;i<lenb;i++)
{
if(bb[i]=='P')
g[lenb-i-1]=1;
else
g[lenb-i-1]=0;
}
S=lena-1;
T=lenb-1;
solve();
for(int i=0;i<=S+T;i++)
FF[i]+=F[i];
//R L S
L=0;
mem(f,0);mem(g,0);
for(int i=0;i<lena;i++)
{
if(aa[i]=='L'||aa[i]=='S')
f[i]=1;
else
f[i]=0;
}
for(int i=0;i<lenb;i++)
{
if(bb[i]=='R')
g[lenb-i-1]=1;
else
g[lenb-i-1]=0;
}
S=lena-1;
T=lenb-1;
solve();
for(int i=0;i<=S+T;i++)
FF[i]+=F[i];
//L K P
L=0;
mem(f,0);mem(g,0);
for(int i=0;i<lena;i++)
{
if(aa[i]=='K'||aa[i]=='P')
f[i]=1;
else
f[i]=0;
}
for(int i=0;i<lenb;i++)
{
if(bb[i]=='L')
g[lenb-i-1]=1;
else
g[lenb-i-1]=0;
}
S=lena-1;
T=lenb-1;
solve();
for(int i=0;i<=S+T;i++)
FF[i]+=F[i];
//K S R
L=0;
mem(f,0);mem(g,0);
for(int i=0;i<lena;i++)
{
if(aa[i]=='S'||aa[i]=='R')
f[i]=1;
else
f[i]=0;
}
for(int i=0;i<lenb;i++)
{
if(bb[i]=='K')
g[lenb-i-1]=1;
else
g[lenb-i-1]=0;
}
S=lena-1;
T=lenb-1;
solve();
for(int i=0;i<=S+T;i++)
FF[i]+=F[i];
ans=0;
for(int i=T;i<=S;i++)
ans=max(ans,FF[i]);
cout<<ans<<endl;
return 0;
}
#include<bits/stdc++.h>
#define mem(a,b) memset((a),b,sizeof(a))
typedef long long ll;
const ll inf=1e18;
const int N=(1<<15)+10;
using namespace std;
char s[1000010];
#define maxn 4000005//开四倍所有数组。
const double pi=acos(-1.0);
struct Complex
{
double x,y;
Complex(double X=0,double Y=0)
{
x=X,y=Y;
}
} a[maxn],b[maxn];
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.x*b.y+a.y*b.x);
}
int S,T,n,m,L,R[maxn],ans[maxn];
long long F[maxn];//存储多项式相乘结果的系数从0-n
double f[maxn],g[maxn];
void FFT(Complex a[maxn],int opt)
{
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),opt*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;
}
}
}
}
void calc(int opt)
{
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)//上限为n,在运用时灵活修改。
F[i]=(long long)(a[i].x/n+0.5)*opt;
}
int main()
{
scanf("%s",s+1);
int len=strlen(s+1);
mem(f,0);
mem(g,0);
S=len+1;
T=len+1;
int p=0;
for(int i=1;i<=len;i++)
{
if(s[i]=='A')
f[i]=1;
else
{g[len-i]=1;p++;}
}
m=S+T;
L=0;
for (n=1; n<=m; 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<=n; ++i)
a[i]=Complex(1.0*f[i],0.0),b[i]=Complex(1.0*g[i],0.0);
calc(1);
for(int i=len+1; i<=len+len-1; i++)
printf("%d\n",F[i]);
return 0;
}