uoj34 多项式乘法（FFT板子）

具体讲解可以去看算法导论。。。迭代版比递归版快到飞起orz

递归版

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <complex>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 262145
#define pi acos(-1)
typedef complex<double> E;
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m;
E a[N],b[N];
inline void fft(E* x,int n,int f){
    if(n==1) return;
    E l[n>>1],r[n>>1];
    for(int i=0;i<n;i+=2)
        l[i>>1]=x[i],r[i>>1]=x[i+1];
    fft(l,n>>1,f);fft(r,n>>1,f);
    E wn(cos(2*pi/n),f*sin(2*pi/n)),w(1,0),t;
    for(int i=0;i<n>>1;++i,w*=wn)
        t=w*r[i],x[i]=l[i]+t,x[i+(n>>1)]=l[i]-t;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=0;i<=n;++i) a[i]=read();
    for(int i=0;i<=m;++i) b[i]=read();
    m=n+m;for(n=1;n<=m;n<<=1);
    fft(a,n,1);fft(b,n,1);
    for(int i=0;i<=n;++i) a[i]=a[i]*b[i];
    fft(a,n,-1);
    for(int i=0;i<=m;++i) printf("%d ",(int)(a[i].real()/n+0.5));
    return 0;
}

迭代版

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <complex>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 262145
#define pi acos(-1)
typedef complex<double> E;
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,R[N],L=0;
E a[N],b[N];
inline void fft(E *a,int f){
    for(int i=0;i<n;++i) if(i<R[i]) swap(a[i],a[R[i]]);
    for(int i=1;i<n;i<<=1){
        E wn(cos(pi/i),f*sin(pi/i));
        for(int p=i<<1,j=0;j<n;j+=p){
            E w(1,0);
            for(int k=0;k<i;++k,w*=wn){
                E x=a[j+k],y=w*a[j+k+i];
                a[j+k]=x+y;a[j+k+i]=x-y;
            }
        }
    }
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=0;i<=n;++i) a[i]=read();
    for(int i=0;i<=m;++i) b[i]=read();
    m=n+m;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));
    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<=m;++i)
        printf("%d ",(int)(a[i].real()/n+0.5));
    return 0;
}