摘要:
Codeforces Round #373 (Div. 2) E. Sasha and Array
原题地址:http://codeforces.com/contest/719/problem/E
题解:
线段树成段更新,lazy标记。
fibonacci数列可以利用矩阵快速幂求出。 阅读全文
posted @ 2016-09-24 22:48
smartweed
阅读(364)
评论(0)
推荐(0)
摘要:
NTT (long long 版) 阅读全文
posted @ 2016-09-24 19:14
smartweed
阅读(265)
评论(0)
推荐(0)
摘要:
时间限制:5000ms 单点时限:5000ms 内存限制:256MB 描述 Profess X is an expert in signal processing. He has a device which can send a particular 1 second signal repeate 阅读全文
posted @ 2016-09-24 18:46
smartweed
阅读(1138)
评论(3)
推荐(0)

浙公网安备 33010602011771号