随笔分类 -  线段树

Codeforces Round #271 (Div. 2) F.Ant colony(线段树 + 统计区间内某数的个数)
摘要：F. Ant colony F. Ant colony Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a streng 阅读全文
posted @ 2016-07-10 21:10 MartinEden 阅读(362) 评论(0) 推荐(0)
HDU 1540 Tunnel Warfare （线段树区间合并）
摘要：Tunnel Warfare Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6931 Accepted Submission(s): 2680 阅读全文
posted @ 2016-07-06 21:27 MartinEden 阅读(169) 评论(0) 推荐(0)
HDU 4027 Can you answer these queries? （线段树区间求和）
摘要：Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 12290 Accepted Subm 阅读全文
posted @ 2016-07-06 21:22 MartinEden 阅读(258) 评论(0) 推荐(0)