线段树
文章平均质量分 85
i-unique
擅长各种姿势划水
展开
-
Codeforces Round #149 (Div. 2) E. XOR on Segment(21棵线段树处理每一位+区间异或)
You've got an array a, consisting of n integers a1, a2, ..., an. You are allowed to perform two operations on this array:Calculate the sum of current array elements on the segment [l, r], that is, count value al + al + 1 + ... + ar.Apply the xor operatio原创 2017-10-15 20:34:50 · 387 阅读 · 0 评论 -
POJ 3667 Hotel(线段树的合并+lazy tag)【很详细!!】
The 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 vacatio原创 2017-07-04 10:20:25 · 1038 阅读 · 2 评论 -
蓝桥杯 操作格子(线段树的更新)
有n个格子,从左到右放成一排,编号为1-n。共有m次操作,有3种操作类型:1.修改一个格子的权值,2.求连续一段格子权值和,3.求连续一段格子的最大值。对于每个2、3操作输出你所求出的结果。原创 2017-07-05 21:19:19 · 353 阅读 · 0 评论 -
HDU 1541 Stars(树状数组||线段树)
Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the right of the given star. Astronomers want to原创 2017-07-10 19:21:49 · 425 阅读 · 0 评论 -
POJ 2481 Cows (线段树||树状数组)
Farmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his field is particularly good. Farmer John has N cows (we number the cows from 1 to N). Each of Farmer Joh原创 2017-07-12 11:23:24 · 480 阅读 · 0 评论 -
CodeForces 52C Circular RMQ (线段树的区间更新+lazy tag)
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 segment原创 2017-07-13 16:37:16 · 526 阅读 · 0 评论 -
HDU 4027 Can you answer these queries?(线段树单点更新+询问+神坑)
A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be marked a value of endurance. For every attack of our secret weapon, it could原创 2017-07-14 09:42:45 · 454 阅读 · 0 评论 -
POJ 1542 Atlantis (线段树+扫描线+离散化)
There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, these maps describe different regions of Atlantis. Your friend Bill has to know原创 2017-07-14 17:21:38 · 680 阅读 · 0 评论 -
TOJ 4325 RMQ with Shifts(线段树的单点更新)
In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each query (L, R) (L<=R), we report the minimum value among A[L], A[L+1], …, A[R]. Note that the indices start from 1, i.e. the left-most element is A[1].In this prob原创 2017-07-15 09:19:21 · 602 阅读 · 0 评论 -
HDU 1540 Tunnel Warfare(线段树区间合并)
During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels lay in a line. Except the two at the ends, every village was directly connected原创 2017-07-16 21:03:25 · 337 阅读 · 0 评论 -
HDU 1828 Picture (线段树+扫描线+离散化)
A number of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical or horizontal. Each rectangle can be partially or totally covered by the others. The length of the boundary of the union of原创 2017-07-18 09:02:00 · 517 阅读 · 0 评论 -
HDU 1754 I Hate It (线段树+单点更新+区间询问)
很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很多学生很反感。 不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。原创 2017-07-24 19:10:13 · 316 阅读 · 0 评论 -
HDU 1394 Minimum Inversion Number(求逆序对+线段树||归并排序)
The 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 first m >= 0 numbers to the end of the seqence, we will obtain原创 2017-07-03 18:41:30 · 374 阅读 · 0 评论 -
HDU 1166 敌兵布阵(线段树查询+单点更新)
C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视。中央情报局要研究敌人究竟演习什么战术,所以Tidy要随时向Derek汇报某一段连续的工兵营地一共有多少人,例如Derek问:“Tidy,马上汇报第3个营地原创 2017-07-03 10:45:49 · 396 阅读 · 0 评论 -
Codeforces 276C Little Girl and Maximum Sum(线段树的区间更新)
The little girl loves the problems on array queries very much.One day she came across a rather well-known problem: you've got an array of nelements (the elements of the array are indexed starting from 1); also, there are qqueries, each one is defined by a原创 2017-10-22 20:25:15 · 407 阅读 · 0 评论 -
codeforces 315 B.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 ass原创 2017-10-29 19:40:31 · 420 阅读 · 0 评论 -
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 F. 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 rectangles shall not be counted more than once. For example,原创 2017-09-24 16:57:25 · 463 阅读 · 0 评论 -
ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 I.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.原创 2017-09-23 17:04:49 · 495 阅读 · 0 评论 -
模板总结
属于自己的模板。。。比赛防忘记赛前复习向原创 2017-07-24 10:25:30 · 1540 阅读 · 1 评论 -
HDU 6183 Color it(线段树+思维+高端的优化技巧)
Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is painting. To prevent him from drawing messy painting, Little D asks you to write a program to maintain following operations. The specific format of thes原创 2017-09-06 16:58:24 · 860 阅读 · 0 评论 -
HDU 6186 CS Course(线段树区间操作)
Little A has come to college and majored in Computer and Science. Today he has learned bit-operations in Algorithm Lessons, and he got a problem as homework. Here is the problem: You are giving n non-negative integers a1,a2,⋯,ana1,a2,⋯,an, and some q原创 2017-09-05 14:48:41 · 356 阅读 · 0 评论 -
POJ 3145Harmony Forever(线段树更新+分情况处理数据+区间极值查询+好题)
We believe that every inhabitant of this universe eventually will find a way to live together in harmony and peace; that trust, patience, kindness and loyalty will exist between every living being of this earth; people will find a way to appreciate and coo原创 2017-08-18 20:34:16 · 474 阅读 · 0 评论 -
ZOJ 3453 Doraemon's Sweet Bullet(线段树区间更新+单点更新+最值询问)
Doraemon likes to shoot his enemies with sweet bullets.n "enemies" stand in a line, each with a life value li (the index i increases from left to right side and starts from 1). Each time Doraemon shoots a sweet bullet from the right side. The ith bullet h原创 2017-08-17 19:53:11 · 230 阅读 · 0 评论 -
HDU-1255 覆盖的面积(线段树扫描线+离散化+改进后超快的算法)
给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.原创 2017-08-17 10:09:09 · 517 阅读 · 0 评论 -
HDU-1255 覆盖的面积(线段树扫描线模板+离散化+加点修改题)
给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.原创 2017-08-16 17:13:06 · 421 阅读 · 0 评论 -
POJ 2828 Buy Tickets(线段树的单点更新)
Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year was approaching, but unluckily the Little Cat still had schedules going here and there. Now, he had to travel by tra原创 2017-07-24 22:09:12 · 282 阅读 · 0 评论 -
POJ 2528 Mayor's posters(离散化+线段树)
The 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 council has finally decided to build an electoral wall for placing the poster原创 2017-07-25 11:33:45 · 315 阅读 · 0 评论 -
HDU 4417 Super Mario(线段树||树状数组+离线操作 之线段树篇)
Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Mario needs to save his lover. We regard the road to the boss’s castle as a line (the length is n), on every原创 2017-08-04 14:53:26 · 633 阅读 · 0 评论 -
WUST 1255 巧克力(线段树的单点区间更新查询)
TY最喜欢做的事情就是吃巧克力,经常幻想拥有吃不完的巧克力,作为一个acmer(菜机),IcY出了个问题准备考考她,如果回答出来,那巧克力自然是源源不断的啦。IcY给出了一列排好的的巧克力,有的是德芙,有的是费列罗,它们都拥有不同的美味值……现在IcY通过魔法更改了这些巧克力,TY必须能指出排列中第K个是巧克力的美味值是多少和某一段巧克力中最美味的值是多少,才能吃到巧克力,否则,哼哼,就去乖乖的做题吧。现在,TY来寻求你的帮助,你能让poor TY吃上巧克力吗?原创 2017-08-04 16:23:39 · 513 阅读 · 0 评论 -
POJ 1436 Horizontally Visible Segments(线段树区间更新)
There is a number of disjoint vertical line segments in the plane. We say that two segments are horizontally visible if they can be connected by a horizontal line segment that does not have any common points with other vertical segments. Three different ve原创 2017-08-05 21:14:43 · 340 阅读 · 0 评论 -
HDU 4533 威威猫系列故事――晒被子(线段树区间更新+分情况推公式)
因为马拉松初赛中吃鸡腿的题目让不少人抱憾而归,威威猫一直觉得愧对大家,这几天他悄悄搬到直角坐标系里去住了。 生活还要继续,太阳也照常升起,今天,威威猫在第一象限晒了N条矩形的被子,被子的每条边都和坐标轴平行,不同被子的某些部分可能会叠在一起。这时候,在原点处突然发了场洪水,时间t的时候,洪水会蔓延到( t, t ),即左下角为( 0, 0 ) ,右上角为( t, t )的矩形内都有水。 悲剧的威威猫想知道,在时间t1, t2, t3 ... tx 的时候,他有多少面积的被子是湿的?原创 2017-08-07 17:08:34 · 415 阅读 · 0 评论 -
UVA 12086 Potentiometers(树状数组|| 线段树单点更新)
A potentiometer, or potmeter for short, is an electronic device with a variable electric resistance. It has two terminals and some kind of control mechanism (often a dial, a wheel or a slide) with which the resistance between the terminals can be adjusted原创 2017-08-08 19:06:15 · 327 阅读 · 0 评论 -
ZOJ 3686 A Simple Tree Problem(树转线段树+线段树区间更新)
Given a rooted tree, each node has a boolean (0 or 1) labeled on it. Initially, all the labels are 0.We define this kind of operation: given a subtree, negate all its labels.And we want to query the numbers of 1's of a subtree.原创 2017-08-08 19:36:30 · 316 阅读 · 0 评论 -
POJ 2886 Who Gets the Most Candies?(反素数+数学推导+模拟+线段树||树状数组+二分)
N children are sitting in a circle to play a game.The children are numbered from 1 to N in clockwise order. Each of them has a card with a non-zero integer on it in his/her hand. The game starts from the K-th child, who tells all the others the integer on原创 2017-08-09 17:33:47 · 417 阅读 · 0 评论 -
CodeForce 356A Knight Tournament(线段树的区间更新+单点询问)
Hooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event.As for you, you're just a simple peasant. There's no surpris原创 2017-08-10 20:40:03 · 406 阅读 · 0 评论 -
HDU 4819 Mosaic(二维线段树区间查询+单点更新模板)
The God of sheep decides to pixelate some pictures (i.e., change them into pictures with mosaic). Here's how he is gonna make it: for each picture, he divides the picture into n x n cells, where each cell is assigned a color value. Then he chooses a cell,原创 2017-08-11 11:34:42 · 616 阅读 · 0 评论 -
HDU1823 Luck and Love(二维线段树单点更新+区间查询+模板)
世界上上最远的距离不是相隔天涯海角 而是我在你面前 可你却不知道我爱你 ―― 张小娴 前段日子,枫冰叶子给Wiskey做了个征婚启事,聘礼达到500万哦,天哪,可是天文数字了啊,不知多少MM蜂拥而至,顿时万人空巷,连扫地的大妈都来凑热闹来了。―_―||| 由于人数太多,Wiskey实在忙不过来,就把统计的事情全交给了枫冰叶子,自己跑回家休息去了。这可够枫冰叶子忙的了,他要处理的有两类事情,一是得接受MM的报名,二是要帮Wiskey查找符合要求的MM中缘分最高值。原创 2017-08-14 19:00:17 · 600 阅读 · 0 评论 -
HDU 4819 Mosaic(二维线段树单点更新+区间查询+自己的写法模板)
The God of sheep decides to pixelate some pictures (i.e., change them into pictures with mosaic). Here's how he is gonna make it: for each picture, he divides the picture into n x n cells, where each cell is assigned a color value. Then he chooses a cell,原创 2017-08-14 21:22:02 · 443 阅读 · 0 评论 -
HDU 3308 LCIS(线段树的区间合并)
Given n integers. You have two operations: U A B: replace the Ath number by B. (index counting from 0) Q A B: output the length of the longest consecutive increasing subsequence (LCIS) in [a, b].原创 2017-08-04 10:36:00 · 423 阅读 · 0 评论 -
ZOJ 3573 Under Attack (线段树两边维护最大值)
Doctor serves at a military air force base. One day, the enemy launch a sudden attack and the base is under heavy fire. The fighters in the airport must take off to intercept enemy bombers. However, the enemies know this clearly and they now focus on destr原创 2017-08-03 20:31:16 · 389 阅读 · 0 评论