
莫队算法
文章平均质量分 83
2997ms
这个作者很懒,什么都没留下…
展开
-
Codeforces 617E:XOR and Favorite Number 莫队算法
E. XOR and Favorite Numbertime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob has a favorite number k and原创 2016-01-26 23:14:59 · 744 阅读 · 0 评论 -
Codeforces 86D:Powerful array
D. Powerful arraytime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn array of positive integers a1, a2, ...原创 2016-01-27 17:33:52 · 581 阅读 · 0 评论 -
SPOJ 3267:DQUERY 莫队
DQUERY - D-queryGiven a sequence of n numbers a1, a2, ..., an and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have to return the number of dis原创 2016-02-04 10:13:33 · 673 阅读 · 0 评论 -
Codechef:Sherlock and Inversions
Sherlock and InversionsAfter a long series of jobless days, Sherlock and Watson frustated by the lack of new cases, decide to turn their minds toward something interesting like solving few logic原创 2016-02-04 10:19:43 · 628 阅读 · 0 评论 -
Codeforces 375D:Tree and Queries 点化成区间 莫队
D. Tree and Queriestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a rooted tree consisting of n v原创 2016-02-04 11:09:43 · 1233 阅读 · 0 评论