
FFT-快速傅里叶变换
文章平均质量分 87
snowy_smile
终于在ICPC World Final里拿到了气球!
再努力一点吧,坚持下去吧,梦想是会实现的! 人生会有低谷,但我更相信,未来也会有更多梦想能够实现~
展开
-
【HDU5751 BestCoder Round 84E】【FFT + 线段树求最值】Eades 最大数出现次数为[1~n]的区间个数
Eades Accepts: 1 Submissions: 11 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)问题描述Peter有一个序列a_1, a_2, ..., a_na1,a2,...,an.原创 2016-07-25 09:36:18 · 1980 阅读 · 0 评论 -
【HDU5730 2016 Multi-University Training Contest 1H】【FFT + cdq 分治】 Shell Necklace f[i]=∑f[i-j] x a[j]
Shell NecklaceTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 290 Accepted Submission(s): 116Problem DescriptionPerhaps the sea‘原创 2016-07-25 09:58:50 · 1346 阅读 · 0 评论 -
【HDU5896 2016 ACM ICPC Asia Regional Shenyang Online E】【DP 排列组合 分治ntt】Running King n个点构成含环无向图的方案数.cp
Running KingTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 201 Accepted Submission(s): 71Problem DescriptionIn People's Republic原创 2016-09-22 10:15:03 · 1579 阅读 · 0 评论