const double Pi = acos(-1.0);
struct complex {
double r, i;
complex(double r = 0, double i = 0):r(r), i(i) {}
complex operator + (const complex &ot) const {
return complex(r + ot.r, i + ot.i);
}
complex operator - (const complex &ot) const {
return complex(r - ot.r, i - ot.i);
}
complex operator * (const complex &ot) const {
return complex(r * ot.r - i * ot.i, r * ot.i + i * ot.r);
}
}x1[N], x2[N];
void change(complex *y, int len) {
for(int i = 1, j = len / 2; i < len - 1; ++i) {
if(i < j) swap(y[i], y[j]);
int k = len / 2;
while(j >= k) {
j -= k;
k >>= 1;
}
j += k;
}
}
void FFT(complex *y, int len, int on) {
change(y, len);
for(int h = 2; h <= len; h <<= 1) {
complex wn = complex(cos(on * 2 * Pi / h), sin(on * 2 * Pi / h));
for(int j = 0; j < len; j += h) {
complex w = complex(1, 0);
for(int k = j; k < j + h / 2; ++k) {
complex u = y[k];
complex t = y[k+h/2] * w;
y[k] = u + t;
y[k+h/2] = u - t;
w = w * wn;
}
}
}
if(on == -1) {
for(int i = 0; i < len; ++i)
y[i].r /= len;
}
}
(模板)FFT
最新推荐文章于 2021-07-28 23:21:09 发布