
线段树
Timeclimber
这个作者很懒,什么都没留下…
展开
-
zoj 2706 Thermal Death of the Universe(线段树区间更新+懒惰标记)
Thermal Death of the UniverseTime Limit: 10 Seconds Memory Limit: 32768 KBJohnie has recently learned about the thermal death concept. Given that the Global Entropy always increases, it原创 2017-08-07 19:52:00 · 389 阅读 · 0 评论 -
hdu 5737
Differencia Time Limit: 10000/10000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 997Accepted Submission(s): 293 Problem Description Prof...原创 2019-07-15 21:04:09 · 183 阅读 · 0 评论 -
ACM-ICPC 2018 徐州赛区网络赛 G. Trace(线段树)
There's a beach in the first quadrant. And from time to time, there are sea waves. A wave ( xx , yy ) means the wave is a rectangle whose vertexes are ( 00 , 00 ), ( xx , 00 ), ( 00 , yy ), ( xx , yy ...原创 2018-09-10 18:40:08 · 565 阅读 · 0 评论 -
CF 483D Interesting Array(线段树)
D. Interesting Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe'll call an array of n non-negative integers a[1], a[2], ..., a[n] interestin...原创 2018-07-06 14:24:34 · 479 阅读 · 0 评论 -
hdu 4614 Vases and Flowers(线段树+二分)
Vases and FlowersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4132 Accepted Submission(s): 1681Problem Description Alice is so popular th...原创 2018-03-12 20:33:38 · 297 阅读 · 0 评论 -
hdu 1540 Tunnel Warfare(线段树区间合并)
Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10884 Accepted Submission(s): 4263Problem DescriptionDuring the War of Resistan...原创 2018-03-11 20:39:37 · 265 阅读 · 0 评论 -
hdu 3974 Assign the task(dfs序+线段树)
Assign the taskTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4270 Accepted Submission(s): 1746Problem DescriptionThere is a company that h...原创 2018-03-10 16:06:59 · 235 阅读 · 0 评论 -
NEFU 1317 神奇的开方运算(线段树)
神奇的开方运算Problem:1317Time Limit:1000msMemory Limit:65535KDescription给出一个数组,现有两种操作1.将某一个区间所有数开方(向下取整)2.询问某一个区间的区间和Input多组样例,对原创 2018-01-24 19:34:03 · 467 阅读 · 0 评论 -
NEFU 1266 (线段树区间更新)
快乐的雨季Problem:1266Time Limit:5000msMemory Limit:65535KDescription 六月到来,长江流域进入了雨季,在长江流域有一个小镇,这个小镇上的百姓都住在一条直线上,共有n户人家,编号为1~n,在直线上按编号依次坐落。进入雨季来,这个小镇共下了q次雨,每次下雨覆盖范围是一个连续的区间(L,R),表示编号为L至R的...原创 2018-07-29 15:07:04 · 387 阅读 · 0 评论 -
poj 2528 Mayor's posters(线段树+离散化)
Language:DefaultMayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 70824 Accepted: 20423DescriptionThe citizens of Bytetown, AB, could原创 2017-12-07 14:03:14 · 259 阅读 · 0 评论 -
poj 3468 A Simple Problem with Integers(线段树区间更新)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 122316 Accepted: 37938Case Time Limit: 2000MSDescriptionYou have原创 2017-12-06 18:45:00 · 253 阅读 · 0 评论 -
zoj 3279 Ants (线段树单点更新)
AntsTime Limit: 2 Seconds Memory Limit: 32768 KBecho is a curious and clever girl, and she is addicted to the ants recently.She knows that the ants are divided into many levels depend原创 2017-08-07 15:47:46 · 357 阅读 · 0 评论 -
hdu 1556 Color the ball(线段树区间更新单点查询+懒惰标记)
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22450 Accepted Submission(s): 10871Problem DescriptionN个气球排成一排,从左到右原创 2017-08-07 14:59:38 · 524 阅读 · 1 评论 -
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. No原创 2017-08-06 23:55:32 · 341 阅读 · 0 评论 -
poj 2777 Count Color(线段树区间更新+技巧)
Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 46667 Accepted: 14137DescriptionChosen Problem Solving and Program design as an optional co原创 2017-08-08 11:36:37 · 378 阅读 · 0 评论 -
2019ICPC南昌网络赛 Hello 2019(线段树维护矩阵)
A digital string is "good": when it contains a subsequence91029102and does not contain a subsequence81028102.The bad value of a string is defined as how many characters are to remove at least, so...原创 2019-09-14 10:51:01 · 390 阅读 · 0 评论