ACM__线段树
文章平均质量分 81
wust_zwl
学不死,就往死里学。
展开
-
hdu-1166 敌兵布阵(线段树的增删查改)
这是我写的第一个线段树题,这种题过程很抽象,代码不容易理解,整整写了三小时,修BUG修了很久,不过还好过了。思路:这个有点像二分的思想,根节点就是全部兵营,下来的第一个左子结点是全部兵的左半,右子节点是剩下的一半,经过重重递归二分,递归的边界就是只剩一个元素,即左子节点等于右子节点,这样,线段树就构造完成了,增删查改都是通过遍历来找到特定区间或元素,再改变它的值。下面附上AC代码:原创 2017-07-03 19:15:34 · 331 阅读 · 0 评论 -
poj-3667 Hotel (线段树区间合并)
he cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ever the competent travel agent, has named the Bullmoose Hotel on famed Cumberland Street as their vacation原创 2017-07-08 15:27:18 · 265 阅读 · 0 评论 -
蓝桥杯_法训练—操作格子(线段树点更新与区间查询)
有n个格子,从左到右放成一排,编号为1-n。共有m次操作,有3种操作类型:1.修改一个格子的权值,2.求连续一段格子权值和,3.求连续一段格子的最大值。对于每个2、3操作输出你所求出的结果。原创 2017-07-08 19:12:33 · 219 阅读 · 0 评论 -
codeforces 52C Circular RMQ(线段树区间更新)【模板】
You are given circular array a0, a1, ..., an - 1. There are two types of operations with it:inc(lf, rg, v) — this operation increases each element on the segment [lf, rg] (inclusively) by v;rmq(lf, rg) — this operation returns minimal value on the segme原创 2017-07-14 09:56:01 · 455 阅读 · 0 评论 -
hdu 1394 Minimum Inversion Number(线段树)【归并排序模板】
归并排序,线段树原创 2017-07-05 22:46:02 · 289 阅读 · 0 评论 -
codeforces 315B Sereja and Array(单点线段树)
Sereja has got an array, consisting of n integers, a1, a2, ..., an. Sereja is an active boy, so he is now going to complete m operations. Each operation will have one of the three forms:Make vi-th array element equal to xi. In other words, perform the as原创 2017-10-29 23:08:51 · 302 阅读 · 0 评论