matrix multiplication ext.
发布于 2019-09-02
利用矩阵快速幂计算T^k*f, 其中T=n*n矩阵, f=n*1向量, t组数据. 法一:每组数据分别计算,矩阵乘法o(n^3), …
OI/ACM
high dimension prefix sum
发布于 2019-08-31
看今天银川2019网络赛K（实际上是2018）的解法，能够将o(3^n)优化到o(n*2^n). 一维前缀和:for(i=1;i& …
Fast Fourier Transform
发布于 2019-07-29
It’s written in 2016,and I just carry it from another blog(zybulu ̷
about surreal number
发布于 2019-07-29
It’s written in 2016,and I just carry it from another blog(zybulu ̷
about suffix automaton
发布于 2019-07-29
It’s written in 2016,and I just carry it from another blog(zybulu ̷