[BZOJ2194]快速傅立叶之二（FFT）

题目：

我是超链接

题解：

什么东西可以被FFT加速呢？

$$c_i=∑_{j=0}^ia_jb_{i−j}$$
$c_0=a_0b_0$
$c_1=a_1b_0+a_0b_1$
…

题目让求什么呢？

$$c_k=∑_{i=k}^{n-1}a_kb_{i−k}$$
不会做啊，把a数组倒过来试试？即a[i]=a[n-i-1]
$$c_k=∑_{i=k}^{n-1}a_{n-k-1}b_{i−k}$$
$c_{n-1}=a_0b_0$
$c_{n-2}=a_1b_0+a_0b_1$
…
出解咯~

常用套路：倒置数组，构造卷积

代码：

#include <cstdio>
#include <cmath>
#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];double x[N];int n,r[N],fn;
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);}
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=a[i+j+k]*w;
                a[i+j]=x+y; a[i+j+k]=x-y;
            }
        }
    }
}
int main()
{
    scanf("%d",&fn);
    for (int i=0;i<fn;i++) scanf("%lf%lf",&x[i],&b[i].x);
    for (int i=0;i<fn;i++) a[i].x=x[fn-i-1];
    fn*=2;int L=0;
    for (n=1;n<=fn;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);fn/=2;
    for (int i=fn-1;i>=0;i--) 
      printf("%d\n",(int)(a[i].x/n+0.5));
}