F.A.Qs Home ProblemSet Status Ranklist Contest LoginRegister
Notice:祝各位Oier新年快乐,Rp++!
大视野在线测评-欢迎您
[ New Thread ]
Problem 5119 >> 这题 是裸的分治+FFT吧
lucia @ 2017-12-18 11:20:40
[ Quote ] [ Edit ] [ Delete ] 1#
这题O(mnlog^2n)的分治FFT
lucia @ 2017-12-18 11:21:26
[ Quote ] [ Edit ] [ Delete ] 2#
bzoj下100s别想过了
save_code @ 2017-12-18 11:21:46
[ Quote ] [ Edit ] [ Delete ] 3#
我现在正在敲这道题, 我怎么又感觉 O(n*m)是可做的, 关键点在于展开 (d1+1)*(d2+1)*...*(dn+1)
save_code @ 2017-12-18 11:27:27
[ Quote ] [ Edit ] [ Delete ] 4#
感觉应该是个短小精悍的题,不过思维很纠结
save_code @ 2017-12-18 11:28:25
[ Quote ] [ Edit ] [ Delete ] 5#
貌似 可以 全用 公式算的 ,再验证一下我有没有推错
save_code @ 2017-12-18 11:33:53
[ Quote ] [ Edit ] [ Delete ] 6#
开始 读错题了 以为 总的点数是 N个。。。
lucia @ 2017-12-18 11:45:28
[ Quote ] [ Edit ] [ Delete ] 7#
你可以去loj交
save_code @ 2017-12-18 15:30:40
[ Quote ] [ Edit ] [ Delete ] 8#
貌似也可以倍增 +FFT 吧。。。。
save_code @ 2017-12-18 15:33:13
[ Quote ] [ Edit ] [ Delete ] 9#
总之好像 转化成了 一个 长度为m的多项式 的 n次方
iloi @ 2017-12-25 10:45:49
[ Quote ] [ Edit ] [ Delete ] 10#
(ಡωಡ)
[Top] [Previous Page] [Next Page]

HOME Back