线段树 && RMQ
SDUTyangkun
这个作者很懒,什么都没留下…
展开
-
poj 3368 Frequent values(RMQ)
Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17812 Accepted: 6417DescriptionYou are given a sequence of n integers a1 , a2 , ... , an原创 2016-11-30 15:38:49 · 237 阅读 · 0 评论 -
Just a Hook(线段树 区间更新)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29771 Accepted Submission(s): 14696Problem DescriptionIn the game原创 2017-02-04 00:16:03 · 267 阅读 · 0 评论 -
Billboard(线段树 单点更新)
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20627 Accepted Submission(s): 8546Problem DescriptionAt the entranc原创 2017-02-03 15:23:27 · 586 阅读 · 0 评论 -
Minimum Inversion Number (单点更新 线段树 )
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19112 Accepted Submission(s): 11525Problem Description原创 2017-02-03 11:44:16 · 1337 阅读 · 0 评论 -
I Hate It(单点更新区间求最值)
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 69004 Accepted Submission(s): 26773Problem Description很多学校流行一种比较的习惯。原创 2017-01-27 12:37:30 · 243 阅读 · 0 评论 -
敌兵布阵(单点更新)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 82179 Accepted Submission(s): 34690Problem DescriptionC国的死对头A国这段时间正在进行军事演原创 2017-01-27 11:02:37 · 419 阅读 · 0 评论 -
poj 2892 hdu 1540Tunnel Warfare(poj 线段树 区间合并)
Tunnel WarfareTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 8021 Accepted: 3325DescriptionDuring the War of Resistance Against Japan, tunnel warfare原创 2017-02-07 20:47:37 · 348 阅读 · 0 评论 -
poj 2352 Stars(线段树 )
StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 45051 Accepted: 19558DescriptionAstronomers often examine star maps where stars are represented by原创 2017-02-07 11:01:25 · 337 阅读 · 0 评论 -
poj 1750Potted Flower(线段树 区间合并 动态规划 区间求最大连续和)
Potted FlowerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4786 Accepted: 1827DescriptionThe little cat takes over the management of a new park. There原创 2017-02-07 08:46:15 · 740 阅读 · 0 评论 -
Mayor's posters(线段树 成段更新)
Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 61557 Accepted: 17790DescriptionThe citizens of Bytetown, AB, could not stand that the ca原创 2017-02-05 19:33:33 · 405 阅读 · 0 评论 -
A Simple Problem with Integers(线段树 成段更新)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 102892 Accepted: 32121Case Time Limit: 2000MSDescriptionYou have N原创 2017-02-04 21:34:44 · 706 阅读 · 0 评论 -
树状数组模板+poj1195(二维树状数组)
在数组长度为n的树状数组中:寻找下一个需要添加的数的下标:int lowbit(int x) { return x&(-x); } 一维树状数组更新是这样的:void add(int x,int val) { for(;x<=n;x+=lowbit(x)) { num[x]+=val; }原创 2016-12-07 21:10:04 · 392 阅读 · 0 评论 -
poj 3321Apple Tree(树状数组+dfs映射)
Apple TreeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 27505 Accepted: 8152DescriptionThere is an apple tree outside of kaka's house. Every autumn, a原创 2016-12-07 21:03:49 · 685 阅读 · 0 评论 -
A Simple Problem with Integers(线段树 做的我想哭)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 101173 Accepted: 31557Case Time Limit: 2000MSDescriptionYou have N原创 2016-12-12 20:13:54 · 325 阅读 · 0 评论 -
poj 2828POJ2828 Buy Tickets【线段树,逆序遍历】
Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 19036 Accepted: 9454DescriptionRailway tickets were difficult to buy around the Lunar New Y原创 2016-12-02 19:48:01 · 570 阅读 · 0 评论 -
RMQ(算法)
1. 概述RMQ(Range Minimum/Maximum Query),即区间最值查询,是指这样一个问题:对于长度为n的数列A,回答若干询问RMQ(A,i,j)(i,j算法。当然,该问题也可以用线段树(也叫区间树)解决,算法复杂度为:O(N)~O(logN),这里我们暂不介绍。2.RMQ算法对于该问题,最容易想到的解决方案是遍历,复杂度是O(n)。但当数据量转载 2016-11-28 20:46:50 · 263 阅读 · 0 评论 -
L2-014. 列车调度(线段树 || set维护最小值)
L2-014. 列车调度时间限制300 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越火车站的列车调度铁轨的结构如下图所示。Figure两端分别是一条入口(Entrance)轨道和一条出口(Exit原创 2017-03-14 19:06:51 · 641 阅读 · 0 评论