线段树&树状数组
「已注销」
这个作者很懒,什么都没留下…
展开
-
RMQ with Shifts(线段树单点跟新)
Problem DescriptionIn the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each query (L, R) (LIn this problem, the array A is no longer static: we need to suppo原创 2014-03-16 11:00:12 · 1634 阅读 · 0 评论 -
HDU-4973-A simple simulation problem.(线段树)
Problem DescriptionThere are n types of cells in the lab, numbered from 1 to n. These cells are put in a queue, the i-th cell belongs to type i. Each time I can use mitogen to double the cells in原创 2014-08-25 00:41:31 · 943 阅读 · 0 评论 -
HDU-4288-Coder(线段树)
Problem Description In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure. The term has become increasing popular since the adven原创 2014-08-25 22:02:02 · 1402 阅读 · 0 评论 -
CF-85D-Sum of Medians(线段树)
In one well-known algorithm of finding the k-th order statistics we should divide all elements into groups of five consecutive elements and find the median of each five. A median is called the middl原创 2014-08-25 22:38:56 · 1199 阅读 · 0 评论 -
hdu-1166-敌兵布阵(线段树)
Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视。原创 2013-12-15 11:00:55 · 662 阅读 · 0 评论 -
HDU-4947-GCD Array(树状数组+莫比乌斯反演)
Problem DescriptionTeacher Mai finds that many problems about arithmetic function can be reduced to the following problem:Maintain an array a with index from 1 to l. There are two kinds of ope原创 2014-08-18 15:21:42 · 2021 阅读 · 1 评论 -
HDU-4419-Colourful Rectangle(线段树)
Problem DescriptionWe use Red, Green and Blue to make new colours. See the picture below:Now give you n rectangles, the colour of them is red or green or blue. You have calculate the area原创 2014-09-25 08:05:11 · 1072 阅读 · 0 评论 -
POJ-2104-K-th Number(函数式线段树)
DescriptionYou are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able原创 2014-07-28 10:30:11 · 1026 阅读 · 0 评论 -
HDU-4819-Mosaic(二维线段树)
Problem DescriptionThe 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原创 2014-07-08 15:44:06 · 920 阅读 · 0 评论 -
HDU-1828-Picture(线段树)
Problem DescriptionA 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原创 2014-07-08 09:38:45 · 1567 阅读 · 0 评论 -
HDU-1754-I Hate It(线段树)
Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input本题目包含多组测试,请处理到文件结束。在每个测试的第一行,有两个正整数 N 和 M ( 0原创 2014-02-25 13:57:16 · 1298 阅读 · 0 评论 -
POJ-3468-A Simple Problem with Integers(线段树区间更新)
DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is原创 2014-03-14 00:21:14 · 860 阅读 · 0 评论 -
HDU-2492-Ping pong(树状数组)
Problem DescriptionN(3<=N<=20000) ping pong players live along a west-east street(consider the street as a line segment).Each player has a unique skill rank. To improve their skill rank, they原创 2014-04-24 16:15:03 · 1153 阅读 · 0 评论 -
POJ-2155-Matrix(二维树状数组 & 二维线段树)
DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 We can change the matrix in the f原创 2014-05-26 07:36:43 · 1086 阅读 · 0 评论 -
HDU-1255-覆盖的面积(线段树)
Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input输入数据的第一行是一个正整数T(1注意:本题的输入数据较多,推荐使用scanf读入数据. Output对于每组测试数据,请计算出被这些矩形覆盖过至少两次的区域的面积.结果保留两位小数. Sample Inpu原创 2014-07-06 20:24:57 · 782 阅读 · 0 评论 -
POJ-2892-Tunnel Warfare(线段树)
DescriptionDuring 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原创 2014-07-05 21:41:23 · 1011 阅读 · 0 评论 -
POJ-2528-Mayor's posters(线段树)
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 counci原创 2014-07-04 15:23:16 · 1715 阅读 · 0 评论 -
HDU-4866-Shooting(函数式线段树)
Problem DescriptionIn the shooting game, the player can choose to stand in the position of [1, X] to shoot, you can shoot all the nearest K targets. The value of K may be different on different shoo原创 2014-07-26 13:18:51 · 1432 阅读 · 0 评论 -
HDU-4031-Attack(树状数组)
Problem DescriptionToday is the 10th Annual of “September 11 attacks”, the Al Qaeda is about to attack American again. However, American is protected by a high wall this time, which can be treatin原创 2014-09-17 23:31:00 · 1053 阅读 · 0 评论