摘要:
HDU 6315 Naive Operations(线段树区间整除区间) Problem Description In a galaxy far, far away, there are two integer sequence a and b of length n. b is a static 阅读全文
摘要:
include include include using namespace std; struct my{ double x,y; }; const int maxn=1000000+10; int n; my a[maxn]; int b[maxn]; int ans[maxn]; int r 阅读全文
摘要:
FFT学习笔记 首先FFT是用来干嘛的呢?求多项式的乘积,怎么回事呢? 设 $$ F(x)=a_0+a_1x^1+a_2x^2+...a_nx^n $$ $$ D(x)=b_0+b_1x^1+b_2x^2+...b_nx^n $$ 然后求它们的卷积,卷积是个什么东东??,卷积和多项式求值其实是一样的 阅读全文