![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
文章平均质量分 90
mrcoderrev
C
展开
-
hdu 1394 Minimum Inversion Number
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16798 Accepted Submission(s): 10215Problem Description原创 2016-06-09 20:41:43 · 245 阅读 · 0 评论 -
light oj 1120 扫描线
Rectangle UnionTime Limit: 2000MSMemory Limit: 65536KB64bit IO Format: %lld & %lluSubmit Status uDebugDescriptionGiven some axis parallel rectangles, you have to find t原创 2016-08-26 10:28:43 · 298 阅读 · 0 评论 -
线段树 扫描线
原文链接:http://www.cnblogs.com/scau20110726/archive/2013/03/21/2972808.htmlhttp://www.cnblogs.com/Booble/archive/2010/10/10/1847163.htmlhttp://www.cnblogs.com/fenshen371/p/3214092.html转载 2016-08-26 10:29:56 · 213 阅读 · 0 评论 -
Codeforces 272C(线段树区间更新)@
Dima's got a staircase that consists of n stairs. The first stair is at height a1, the second one is at a2, the last one is at an (1 ≤ a1 ≤ a2 ≤ ... ≤ an).Dima decided to play with the staircase,原创 2017-05-13 08:51:23 · 239 阅读 · 0 评论 -
1129 - 喵哈哈村的战斗魔法师丶坏坏い月(线段树)@
1129 - 喵哈哈村的战斗魔法师丶坏坏い月Time Limit:3s Memory Limit:256MByteSubmissions:343Solved:77DESCRIPTION坏坏い月是月大叔的ID,他是一个掌握者772002种魔法的物理系战士,最擅长的技能就是搞事。今天他又要开始搞事了。给你nn个数,你需要实现一下操作:原创 2017-06-04 08:52:15 · 311 阅读 · 0 评论 -
AtCoder Regular Contest 080 E - Young Maids(线段树+优先队列)
E - Young MaidsTime limit : 2sec / Memory limit : 256MBScore : 800 pointsProblem StatementLet N be a positive even number.We have a permutation of (1,2,…,N), p=(p1,p2,…,pN).原创 2017-08-07 21:05:24 · 343 阅读 · 0 评论 -
codeforces.contest/833/problem/B(DP+线段树维护最大值)
The Bakerytime limit per test2.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSome time ago Slastyona the Sweetmaid decide原创 2017-08-02 17:27:49 · 271 阅读 · 0 评论 -
51nod 1562 玻璃切割(线段树区间合并)
1562 玻璃切割题目来源: CodeForces基准时间限制:1.5 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 收藏 关注现在有一块玻璃,是长方形的(w 毫米× h 毫米),现在要对他进行切割。切割的方向有两种,横向和纵向。每一次切割之后就会有若干块玻璃被分成两块更小的玻璃。在切割之后玻璃不会原创 2017-09-04 10:20:51 · 382 阅读 · 0 评论 -
hdu 6183 Color it(变种线段树)
Color itTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 629 Accepted Submission(s): 167Problem DescriptionDo you like pai原创 2017-09-04 14:21:02 · 499 阅读 · 0 评论 -
Wannafly模拟赛4 C Sum(线段树)
题目描述考虑维护一个这样的问题:(1) 给出一个数组A,标号为1~n(2) 修改数组中的一个位置。(3) 询问区间[l,r]中所有子集的位运算and之和mod(109+7)。位运算and即为“pascal中的and”和“C/C++中的&”我们定义集合S={ l , l+1 , ... , r-1 , r}若集合T,T ∩ S = T,则称T为S的子集设f(T)=原创 2017-10-21 11:58:21 · 285 阅读 · 0 评论 -
poj 1151 扫描线
AtlantisTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21347 Accepted: 8041DescriptionThere are several ancient Greek texts that contain descriptions o原创 2016-08-26 10:27:42 · 266 阅读 · 0 评论 -
hdu 1255
覆盖的面积Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5170 Accepted Submission(s): 2606Problem Description给定平面上若干矩形,求出被这些矩形覆盖原创 2016-08-26 10:27:00 · 251 阅读 · 0 评论 -
hdu 1698
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 sa原创 2016-08-28 10:25:17 · 215 阅读 · 0 评论 -
light oj 1080 区间更新
Binary SimulationTime Limit: 2000MSMemory Limit: 65536KB64bit IO Format: %lld & %lluSubmit Status uDebugDescriptionGiven a binary number, we are about to do some oper原创 2016-08-28 10:28:17 · 274 阅读 · 0 评论 -
hdu 2795
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19243 Accepted Submission(s): 8053Problem DescriptionAt the entranc原创 2016-08-28 10:28:58 · 208 阅读 · 0 评论 -
hdu 1166 单点更新
hdu敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 72373 Accepted Submission(s): 30323Problem DescriptionC国的死对头A国这段时间正在进行原创 2016-06-06 20:45:46 · 306 阅读 · 0 评论 -
hdu 1754 I Hate It 区间更新
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 61203 Accepted Submission(s): 23854Problem Description很多学校流行一种比较的习惯。原创 2016-06-07 19:56:30 · 200 阅读 · 0 评论 -
poj 2892 区间合并
Tunnel WarfareTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 7803 Accepted: 3224DescriptionDuring the War of Resistance Against Japan, tunnel warfare原创 2016-08-09 12:04:28 · 291 阅读 · 0 评论 -
线段树,树状数组,RMQ之间的区别与联系
树状数组主要用于计算区间的和,在区间元素修改值的时候能够快速修改而不是以O(n)的复杂度进行修改;线段树是把区间以树的形式分拆为若干个小区间,每个小区间存的都有一个值(树状数组的元素存的是区间值),所以线段树可以快速获得这个区间里面的所有的节点(元素),主要用于计算每个区间的最大最小元素(也可以快速转载 2016-08-14 12:44:22 · 372 阅读 · 0 评论 -
hdu 4267
A Simple Problem with IntegersTime Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5282 Accepted Submission(s): 1674Problem Descriptio原创 2016-08-26 10:26:06 · 275 阅读 · 0 评论 -
hdu 4553 (区间合并)
约会安排Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1167 Accepted Submission(s): 344Problem Description 寒假来了,又到了小明和女神们约会的季节。原创 2016-08-26 10:26:46 · 303 阅读 · 0 评论 -
喵哈哈村的冒菜店(线段树 区间合并)
喵哈哈村的冒菜店发布时间: 2017年3月19日 16:00 最后更新: 2017年3月19日 16:01 时间限制: 1000ms 内存限制: 128M描述喵哈哈村的冒菜店开张了,这里的冒菜特别好吃。星星同学听闻后,就准备去吃冒菜。星星同学开着自己才花了几十万买的宝马X5,就开进了冒菜店的停车场。就在她停车的过程中,她发现一个有趣的现象原创 2017-03-28 23:03:20 · 143 阅读 · 0 评论