线段树
Zars19
OIer.
展开
-
[HDU 1394]Minimum Inversion Number(归并排序/线段树)
DescriptionThe inversion number of a given number sequence a1, a2, …, an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.For a given sequence of numbers a1, a2, …, an, if we move the fir原创 2017-02-03 19:46:08 · 207 阅读 · 0 评论 -
[HDU 1698]Just a Hook(线段树)
Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same le原创 2017-02-03 15:50:27 · 202 阅读 · 0 评论 -
[BZOJ 1858][Scoi2010]序列操作(线段树)
Descriptionlxhgww最近收到了一个01序列,序列里面包含了n个数,这些数要么是0,要么是1,现在对于这个序列有五种变换操作和询问操作: 0 a b 把[a, b]区间内的所有数全变成0 1 a b 把[a, b]区间内的所有数全变成1 2 a b 把[a,b]区间内的所有数全部取反,也就是说把所有的0变成1,把所有的1变成0 3 a b 询问[a, b]区间内总共有多少个1 4 a b原创 2017-03-03 20:34:31 · 421 阅读 · 0 评论 -
[POJ 2777]Count Color(线段树)
DescriptionChosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem.There is a very long board with length L centimet原创 2017-02-03 23:27:52 · 210 阅读 · 0 评论