线段树
文章平均质量分 82
闻道-问道
这个作者很懒,什么都没留下…
展开
-
I Hate It (线段树单点更新,求最值)
Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input本题目包含多组测试,请处理到文件结束。在每个测试的第一行,有两个正整数 N 和 M ( 0<N原创 2017-09-03 19:20:57 · 177 阅读 · 0 评论 -
线段树单点,和区间更新模板
描述上回说到:小Hi给小Ho出了这样一道问题:假设整个货架上从左到右摆放了N种商品,并且依次标号为1到N,每次小Hi都给出一段区间[L, R],小Ho要做的是选出标号在这个区间内的所有商品重量最轻的一种,并且告诉小Hi这个商品的重量。但是在这个过程中,可能会因为其他人的各种行为,对某些位置上的商品的重量产生改变(如更换了其他种类的商品)。小Ho提出了两种非常简单的方法,但是都不能完美的解决。那么这...原创 2018-03-13 22:30:37 · 208 阅读 · 0 评论 -
#1080 : 更为复杂的买卖房屋姿势(线段树区间add和区间set)
时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi和小Ho都是游戏迷,“模拟都市”是他们非常喜欢的一个游戏,在这个游戏里面他们可以化身上帝模式,买卖房产。在这个游戏里,会不断的发生如下两种事件:一种是房屋自发的涨价或者降价,而另一种是政府有关部门针对房价的硬性调控。房价的变化自然影响到小Hi和小Ho的决策,所以他们希望能够知道任意时刻某个街道中所有房屋的房价总和是多少——...原创 2018-04-08 19:29:05 · 175 阅读 · 0 评论 -
前缀查询(字典树+线段树懒惰标记)
描述 在一个 Minecraft 村庄中,村长有这一本小写字母构成的名册(字符串的表),每个名字旁边都记录着这位村民的声望值,而且有的村民还和别人同名。随着时间的推移,因为没有村民死亡,这个名册变得十分大。现在需要您来帮忙维护这个名册,支持下列 4 种操作:1. 插入新人名 si,声望为 ai2. 给定名字前缀 pi 的所有人的声望值变化 di3. 查询名字为 sj 村民们的声望值的和(因为会有重...原创 2018-04-25 17:16:38 · 501 阅读 · 0 评论 -
FZU - 2277(树链剖分或dfs序+线段树)
There is a rooted tree with n nodes, number from 1-n. Root’s number is 1.Each node has a value ai.Initially all the node’s value is 0.We have q operations. There are two kinds of operations.1 v x k : ...原创 2018-04-28 10:06:15 · 274 阅读 · 0 评论 -
Frequent values (线段树)
You are given a sequence of n integers a1, a2, . . . , an in non-decreasing order. In addition to that, youare given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). For each query, dete...原创 2018-06-20 20:53:59 · 257 阅读 · 0 评论 -
RMQ with Shifts (线段树)
In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for eachquery (L, R) (L ≤ R), we report the minimum value among A[L], A[L + 1], . . . , A[R]. Note that theindices ...原创 2018-06-20 21:18:31 · 426 阅读 · 0 评论 -
Weird Advertisement (线段树+扫描线)
2DPlaneLand is a land just like a huge 2D plane. The range of X axis is 0 to 109 and the range ofY axis is also 0 to 109. People built houses only in integer co-ordinates and there is exactly one hous...原创 2018-06-20 21:40:51 · 267 阅读 · 0 评论 -
Glad You Came (线段树)
Problem DescriptionSteve has an integer array a of length n (1-based). He assigned all the elements as zero at the beginning. After that, he made m operations, each of which is to update an in...原创 2018-08-06 17:40:11 · 291 阅读 · 0 评论 -
HDU - 5493(线段树)
NN people numbered from 1 to NN are waiting in a bank for service. They all stand in a queue, but the queue never moves. It is lunch time now, so they decide to go out and have lunch first. When they ...原创 2019-01-18 20:40:45 · 266 阅读 · 0 评论 -
#1586 : Minimum(线段树)
描述You are given a list of integers a0, a1, …, a2^k-1.You need to support two types of queries:1. Output Minx,y∈[l,r] {ax∙ay}.2. Let ax=y.输入The first line is an integer T, indicating the number of test...原创 2018-03-15 23:30:01 · 251 阅读 · 0 评论 -
日记
今天主要算是复习和进一步学习了线段树的相关知识,首先从最基本的单点更新,单线查询(或区间查询)到 区间更新,单点查询(区间查询)。 一般,这些线段树的问题的建树过程基本类似,在单点更新里,会用到pushpu操作,来利用孩子节点的信息更新本结点信息,但用不到pushdow。但单点查询很少,如果单点查询,树状数组写起来更方便。区间查询,因为当进行查询操作的时候,本区间l,r一定包含需...原创 2018-03-01 00:24:13 · 152 阅读 · 0 评论 -
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原创 2017-09-14 20:08:54 · 267 阅读 · 0 评论 -
Overlapping Rectangles(线段树,矩形面积并)
There are nn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with each other, and the overlapped areas of these re原创 2017-09-24 21:14:49 · 591 阅读 · 0 评论 -
Billboard (线段树,多维)
Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements原创 2017-09-26 16:03:44 · 255 阅读 · 0 评论 -
Count Color (线段树,区间更新)
Problem 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原创 2017-09-28 23:49:46 · 258 阅读 · 0 评论 -
Buy Tickets (线段树)
Buy Tickets Time Limit : 8000/4000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 48 Accepted Submission(s) : 23Problem DescriptionRailway tickets were dif原创 2017-10-08 21:18:11 · 270 阅读 · 0 评论 -
小明系列问题——小明序列 (线段树优化的最长上升子序列)
Problem Description 大家都知道小明最喜欢研究跟序列有关的问题了,可是也就因为这样,小明几乎已经玩遍各种序列问题了。可怜的小明苦苦地在各大网站上寻找着新的序列问题,可是找来找去都是自己早已研究过的序列。小明想既然找不到,那就自己来发明一个新的序列问题吧!小明想啊想,终于想出了一个新的序列问题,他欣喜若狂,因为是自己想出来的,于是将其新序列问题命名为“小明序列”。原创 2017-10-08 21:38:54 · 708 阅读 · 0 评论 -
Luck and Love (线段树)
Problem Description世界上上最远的距离不是相隔天涯海角而是我在你面前可你却不知道我爱你 ―― 张小娴前段日子,枫冰叶子给Wiskey做了个征婚启事,聘礼达到500万哦,天哪,可是天文数字了啊,不知多少MM蜂拥而至,顿时万人空巷,连扫地的大妈都来凑热闹来了。―_―|||由于人数太多,Wiskey实在忙不过来,就把统计的事情全原创 2017-10-12 23:25:10 · 373 阅读 · 0 评论 -
Mayor's posters (线段树+离散化+区间更新)
Problem DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city原创 2017-10-12 23:27:11 · 251 阅读 · 0 评论 -
小a的排列(线段树维护)
链接:https://ac.nowcoder.com/acm/contest/317/G来源:牛客网 题目描述小a有一个长度为nn的排列。定义一段区间是"萌"的,当且仅当把区间中各个数排序后相邻元素的差为11现在他想知道包含数x,yx,y的长度最小的"萌"区间的左右端点也就是说,我们需要找到长度最小的区间[l,r][l,r],满足区间[l,r][l,r]是"萌"的,且同时包含数x...原创 2019-01-22 20:04:12 · 243 阅读 · 2 评论