线段树
菜圾
Hi, it's your Accepted !
展开
-
HDU 1698 Just a Hook(线段树:区间更新,区间查询)
In 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 length.Now原创 2017-09-07 10:41:18 · 276 阅读 · 0 评论 -
poj-3368-Frequent values-(线段树)
DescriptionYou are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). Fo原创 2017-10-14 11:26:00 · 242 阅读 · 0 评论 -
hdu-154-Tunnel Warfare(线段树,区间)
Problem 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原创 2017-10-14 21:44:48 · 216 阅读 · 0 评论 -
hdu-4614-Vases and Flowers(线段树,区间更新区间查询,lazy,二分)
Problem Description Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers, she will try to put them in the vases, o原创 2017-10-15 15:44:06 · 253 阅读 · 0 评论 -
POJ-2482-Stars in Your Window(线段树,扫描线)
Problem DescriptionFleeting time does not blur my memory of you. Can it really be 4 years since I first saw you? I still remember, vividly, on the beautiful Zhuhai Campus, 4 years ago, from the mo原创 2017-10-15 19:45:18 · 336 阅读 · 0 评论 -
hdu - 5475 - An easy problem - (线段树)
One day, a useless calculator was being built by Kuros. Let's assume that number X is showed on the screen of calculator. At first, X = 1. This calculator only supports two types of operation. 1. mu原创 2017-12-03 17:20:47 · 204 阅读 · 0 评论 -
UVA - 12086 - Potentiometers - (单点更新,区间查询)
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3238题意:有长为n的数组a[],对其有多次操作,有两种操作类型:①.S pos,val;将数组中元素a[pos]的值改为val②.M x,y;查询a[l]~a[r]的和解...原创 2018-06-14 22:25:52 · 191 阅读 · 0 评论 -
UVA - 12299 - RMQ with Shifts - (单点更新,区间查询)
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3720题意:给出一个长为n的数组,先对其有q次操作,操作有两种类型:①.query(l,r)作用即是在区间a[l]~a[r]中找最小值②.shift(i1,i2,i3...i...原创 2018-06-17 22:38:14 · 143 阅读 · 0 评论 -
2015 Multi-University Training Contest 2 - Gorgeous Sequence - (线段树,区间更新,区间查询)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5306题意:给出数字A,有3种操作,0操作将区间[x,y]中的每个元素ai替换为min(ai,t),1操作查询区间[x,y]中的最大值,2操作查询区间中[x,y]的元素和。解析:此题用到一种比较复杂的懒惰标记方法。主要一点是每个区间统计有多少个元素不大于t;这样统计sum时分两步,先统计这些不大...原创 2018-07-18 16:07:49 · 158 阅读 · 0 评论 -
(HDU6345)2018"百度之星"程序设计大赛 - 资格赛 - 1002 - (线段树解法)
链接:http://acm.hdu.edu.cn/showproblem.php?pid=6345题意:给出大写字母字符串a1~n,有q次询问,每次询问(l,r),你需要回答字符串a[l,r]=alal+1⋯ar 内有多少个非空子串是 a[l,r]的所有非空子串中字典序最小的。解析:题意可以理解为每次查询找区间[l,r]中的最小字母出现的次数,本来想到莫队算法,但是会超时...原创 2018-08-06 10:46:00 · 345 阅读 · 0 评论 -
2018 Multi-University Training Contest 5 - (E,G)
1005 Everything Has Changed 题意:初始有原点在(0,0)半径为R的圆盘,现在有m个圆的圆心为(xi,yi)半径为ri对圆盘进行切割,小圆之间不相交,没有一个小圆将整个圆盘切出,问企切割后圆盘的外周长。解析:考虑只有内切,相交两种情况对外周长有贡献。内切直接加上小圆周长即可;相交时设dis=sqrt(xi*xi+yi*yi)为圆心之间距离,那么...原创 2018-08-07 09:55:47 · 249 阅读 · 0 评论 -
POJ-2886-Who Gets the MostCandies?-(线段树)
Problem DescriptionN 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/he原创 2017-10-12 11:32:02 · 312 阅读 · 0 评论 -
hdu-3016-Man Down(线段树)
Problem DescriptionThe Game “Man Down 100 floors” is an famous and interesting game.You can enjoy the game from http://hi.baidu.com/abcdxyzk/blog/item/16398781b4f2a5d1bd3e1eed.htmlWe take原创 2017-10-12 22:46:34 · 334 阅读 · 0 评论 -
POJ 2777-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 10:22:03 · 226 阅读 · 0 评论 -
POJ-2828-Buy Tickets-(线段树)
Buy TicketsTime Limit: 4000MS Memory Limit: 65536K DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up原创 2017-10-06 20:12:23 · 211 阅读 · 0 评论 -
hdu-1823-Luck and Love-(二维线段树)
Problem Description世界上上最远的距离不是相隔天涯海角而是我在你面前可你却不知道我爱你 ―― 张小娴前段日子,枫冰叶子给Wiskey做了个征婚启事,聘礼达到500万哦,天哪,可是天文数字了啊,不知多少MM蜂拥而至,顿时万人空巷,连扫地的大妈都来凑热闹来了。―_―|||由于人数太多,Wiskey实在忙不过来,就把统计的事原创 2017-10-07 00:04:59 · 256 阅读 · 0 评论 -
ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛-题目9 : Minimum-(线段树)
ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛-题目9 : 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 16:49:13 · 1685 阅读 · 0 评论 -
hdu-45221-小明系列问题——小明序列-(线段树)
Problem Description 大家都知道小明最喜欢研究跟序列有关的问题了,可是也就因为这样,小明几乎已经玩遍各种序列问题了。可怜的小明苦苦地在各大网站上寻找着新的序列问题,可是找来找去都是自己早已研究过的序列。小明想既然找不到,那就自己来发明一个新的序列问题吧!小明想啊想,终于想出了一个新的序列问题,他欣喜若狂,因为是自己想出来的,于是将其新序列问题命名为“小明序列”。原创 2017-10-07 20:27:59 · 333 阅读 · 0 评论 -
bzoj1012-(线段树)
现在请求你维护一个数列,要求提供以下两种操作:1、 查询操作。语法:Q L 功能:查询当前数列中末尾L个数中的最大的数,并输出这个数的值。限制:L不超过当前数列的长度。2、 插入操作。语法:A n 功能:将n加上t,其中t是最近一次查询操作的答案(如果还未执行过查询操作,则t=0),并将所得结果对一个固定的常数D取模,将所得答案插入到数列的末尾。限制:n是非负整数并且在长整范围内。注意原创 2017-10-02 18:41:59 · 245 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers-(线段树)
Problem 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原创 2017-10-04 10:38:02 · 265 阅读 · 0 评论 -
HDU-1754-I Hate It-(线段树)
HDU-1754-I Hate It-(线段树)很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input本题目包含多组测试,请处理到文件结束。 在每个测试的第一行,有两个正整数 N 和 M ( 0<N<=200000,0<M<5000 ),分别代表学生的数目和操作的数目。 学生ID编号分别从1编到N。 第二行包含N原创 2017-09-02 21:44:44 · 409 阅读 · 0 评论 -
POJ+2528+Mayor's posters(线段树,离散化)
Mayor's postersThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places原创 2017-10-06 16:34:25 · 270 阅读 · 0 评论 -
2017年10月12日训练笔记
线段树不好做,今天在606坐了挺长时间,很多题目还是没思路,有的题目看题解都要理解好长时间。。。。。还有10个题目没做,这个星期就结束了还有3天时间,得抓紧时间,然后再结束完专题之后如果有时间以后要回顾一下这些题目,多留意一些线段树,现在课相对少了些,继续加油吧。原创 2017-10-12 22:36:17 · 183 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第十场)- A - Rikka with Lowbit - (线段树 or 树状数组)
题目链接:https://www.nowcoder.com/acm/contest/148/A题意:有函数f(x)它的值有一半概率是x - lowbit(x),一半概率是x + lowbit(x)。现在给出数组A[]对其有两种操作:①.给[L,R]区间内Ai赋值为f(A[i]);②.查询区间[L,R]内Ai和的期望。解析:由于每个被操作的元素减和加的概率相同,所以期望值不变。直接无视操作1...原创 2018-08-19 20:23:24 · 274 阅读 · 2 评论