题目大意:计算C[k]=sigma(a[i]*b[i-k]) 其中 k < = i < n ,( n < = 10 ^ 5, a,b中的元素均为小于等于100的非负整数)
题目名剧透…
FFT可以用于快速求卷积(即下标和为定值),有一常用技巧即构造序列使表达式变为卷积的形式,本题将a数组翻转(即令a’[i]=a[n-i-1]),表达式就变成了a[i]*b[i-k]=a’[n-i-1]*b[i-k],即卷积的形式,则将a’与b相乘,答案取第n-1项~第0项即可
#include <cstdio>
#include <cmath>
#include <algorithm>
#define N 300000
using namespace std;
const double pi=acos(-1),DFT=2.0,IDFT=-2.0;
struct Complex {
double x,y;
Complex(const double a=0.0,const double b=0.0) : x(a),y(b) {}
Complex operator + (const Complex& rhs) const { return Complex(x+rhs.x,y+rhs.y); }
Complex operator - (const Complex& rhs) const { return Complex(x-rhs.x,y-rhs.y); }
Complex operator * (const Complex& rhs) const { return Complex(x*rhs.x-y*rhs.y,y*rhs.x+x*rhs.y); }
}a[N],b[N],c[N];
int n,len,pos[N];
void init() {
len=1;
while(len<n*2) len*=2;
for(int i=1;i<len;i++) {
pos[i]=pos[i/2]/2;
if(i&1) pos[i] |= len/2;
}
return ;
}
void FFT(Complex x[],double mode) {
for(int i=0;i<len;i++)
if(i<pos[i]) swap(x[i],x[pos[i]]);
for(int i=2;i<=len;i*=2) {
int step=i/2;
Complex wm(cos(2*pi/i),sin(mode*pi/i));
for(int j=0;j<len;j+=i) {
int limit=j+step;
Complex w(1,0);
for(int k=j;k<limit;k++) {
Complex y=x[k],z=w*x[k+step];
x[k]=y+z; x[k+step]=y-z;
w=w*wm;
}
}
}
if(mode==IDFT)
for(int i=0;i<len;i++)
x[i].x/=len;
return ;
}
int main() {
freopen("a.in","r",stdin); freopen("a.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++) {
int x;
scanf("%d",&x); a[n-i-1].x=floor(x);
scanf("%d",&x); b[i].x=floor(x);
}
init();
FFT(a,DFT); FFT(b,DFT);
for(int i=0;i<len;i++) c[i]=a[i]*b[i];
FFT(c,IDFT);
for(int i=n-1;~i;i--) printf("%d\n",int(floor(c[i].x+0.5)));
return 0;
}