
线段树
文章平均质量分 82
AnICoo1
这个作者很懒,什么都没留下…
展开
-
POJ 3468 A Simple Problem with Integers(区间更新+区间求和)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 78622 Accepted: 24231Case Time Limit: 2000MSDescriptionYou have N i原创 2015-08-24 15:23:24 · 363 阅读 · 0 评论 -
HDOJ 1698 Just a Hook(区间更新)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23067 Accepted Submission(s): 11551Problem DescriptionIn the game of D原创 2015-08-21 20:35:19 · 391 阅读 · 0 评论 -
HDOJ 1541 Stars(线段树单点更新)
StarsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6668 Accepted Submission(s): 2657Problem DescriptionAstronomers often examin原创 2015-10-21 14:13:46 · 475 阅读 · 0 评论 -
HDOJ 5443 The Water Problem(线段树区间最值)(长春网络赛)
The Water ProblemTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 302 Accepted Submission(s): 245Problem DescriptionIn Land wate原创 2015-09-14 13:36:57 · 528 阅读 · 0 评论 -
NYOJ 1185 最大最小值 (线段树区间最值 水)
最大最小值时间限制:1000 ms | 内存限制:65535 KB难度:2描述 给出N个整数,执行M次询问。对于每次询问,首先输入三个整数C、L、R: 如果C等于1,输出第L个数到第R个数之间的最小值; 如果C等于2,输出第L个数到第R个数之间的最大值; 如果C等于3,输出第L个数到第R个数之间的最小值与最大值的和。(包括第L个数和第R原创 2015-11-09 22:06:46 · 583 阅读 · 0 评论 -
HDOJ 5596 GTW likes gt (线段树区间更新+单点查询+技巧)
GTW likes gtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 609 Accepted Submission(s): 210Problem DescriptionLong long ago, th原创 2015-12-13 20:33:30 · 631 阅读 · 0 评论 -
Codeforces Round #333 (Div. 2) B. Approximating a Constant Range (线段树区间最值)
B. Approximating a Constant Rangetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Xellos was doing a pra原创 2015-12-30 11:28:05 · 694 阅读 · 0 评论 -
ZOJ 3911 Prime Query (线段树+单点更新+区间lazy更新+素数判断计数)
Prime QueryTime Limit: 1 Second Memory Limit: 196608 KBYou are given a simple task. Given a sequence A[i] with N numbers. You have to perform Q operations on the given sequence.Here are原创 2016-01-26 12:31:15 · 401 阅读 · 0 评论 -
HDOJ 5408 Conturbatio (双线段树+单点更新+区间和)
ConturbatioTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 680 Accepted Submission(s): 314Problem DescriptionThere are many rook原创 2016-02-12 13:21:10 · 378 阅读 · 0 评论 -
Codeforces Round #343 (Div. 2) B. Far Relative’s Problem (线段树+区间更新+单点查询)
B. Far Relative’s Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFamil Door wants to celebrate his birthday原创 2016-02-21 21:10:18 · 658 阅读 · 0 评论 -
hdu5316 Magician (线段树+单点更新+区间查询+区间合并)
Magician Time Limit: 18000/9000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3084 Accepted Submission(s): 838Problem Description Fantasy magicians usually ga原创 2016-07-23 10:16:25 · 1109 阅读 · 0 评论 -
Light OJ 1082 1082 - Array Queries(区间最值)
1082 - Array QueriesPDF (English)StatisticsForumTime Limit: 3 second(s)Memory Limit: 64 MBGiven an array with N elements, indexed from 1toN. N原创 2015-08-20 21:26:56 · 379 阅读 · 0 评论 -
HDOJ 1556 Color the ball (线段树+区间更新)
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13040 Accepted Submission(s): 6519Problem DescriptionN个气球排成一排,从左到右依原创 2015-08-20 13:05:40 · 499 阅读 · 1 评论 -
ZOJ 1610 Count the Colors(数组模拟)
Count the ColorsTime Limit: 2 Seconds Memory Limit: 65536 KB Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your原创 2015-08-19 19:50:21 · 300 阅读 · 0 评论 -
POJ 2828 Buy Tickets(线段树--单点更新)
Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 16196 Accepted: 8059DescriptionRailway tickets were difficult to buy around the Lunar New Yea原创 2015-08-30 21:29:11 · 640 阅读 · 0 评论 -
HDOJ 1394 Minimum Inversion Number 求循环串的最小逆序数(暴力&&线段树)
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14879 Accepted Submission(s): 9082Problem DescriptionThe原创 2015-08-31 23:07:32 · 927 阅读 · 0 评论 -
POJ 2777 Count Color(位运算+线段树+lazy+区间更新)
Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 39905 Accepted: 12034DescriptionChosen Problem Solving and Program design as an optional course原创 2015-08-31 12:50:04 · 666 阅读 · 0 评论 -
HDOJ 2795 Billboard(单点更新+区间最值)
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15661 Accepted Submission(s): 6599Problem DescriptionAt the entrance to原创 2015-08-19 10:06:50 · 299 阅读 · 0 评论 -
NYOJ 116 士兵杀敌(二)(线段树区间求和+单点更新)
士兵杀敌(二)时间限制:1000 ms | 内存限制:65535 KB难度:5描述 南将军手下有N个士兵,分别编号1到N,这些士兵的杀敌数都是已知的。小工是南将军手下的军师,南将军经常想知道第m号到第n号士兵的总杀敌数,请你帮助小工来回答南将军吧。南将军的某次询问之后士兵i可能又杀敌q人,之后南将军再询问的时候,需要考虑到新增的杀敌数。输入只有一组测原创 2015-09-01 12:26:29 · 572 阅读 · 0 评论 -
NYOJ 228 士兵杀敌(五)(数组灵活运用)
士兵杀敌(五)时间限制:2000 ms | 内存限制:65535 KB难度:5描述 南将军麾下有百万精兵,现已知共有M个士兵,编号为0~M,每次有任务的时候,总会有一批编号连在一起人请战(编号相近的人经常在一块,相互之间比较熟悉),最终他们获得的军功,也将会平分到每个人身上,这样,有时候,计算他们中的哪一个人到底有多少军功就是一个比较困难的事情。在这样的情况下,南将原创 2015-09-01 21:42:30 · 456 阅读 · 0 评论 -
NYOJ 123 士兵杀敌(四)(线段树--区间更新+单点查询)
士兵杀敌(四)时间限制:2000 ms | 内存限制:65535 KB难度:5描述 南将军麾下有百万精兵,现已知共有M个士兵,编号为1~M,每次有任务的时候,总会有一批编号连在一起人请战(编号相近的人经常在一块,相互之间比较熟悉),最终他们获得的军功,也将会平分到每个人身上,这样,有时候,计算他们中的哪一个人到底有多少军功就是一个比较困难的事情,军师小工的任务就是在南将军询原创 2015-09-01 20:19:30 · 566 阅读 · 0 评论 -
NYOJ 119 士兵杀敌(三)(线段树--区间最值之差)
士兵杀敌(三)时间限制:2000 ms | 内存限制:65535 KB难度:5描述 南将军统率着N个士兵,士兵分别编号为1~N,南将军经常爱拿某一段编号内杀敌数最高的人与杀敌数最低的人进行比较,计算出两个人的杀敌数差值,用这种方法一方面能鼓舞杀敌数高的人,另一方面也算是批评杀敌数低的人,起到了很好的效果。所以,南将军经常问军师小工第i号士兵到第j号士兵中,杀敌数最高的人原创 2015-09-01 12:57:52 · 528 阅读 · 0 评论 -
HDOJ 1754 I Hate It(单点更新+区间最值)
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 51623 Accepted Submission(s): 20224Problem Description很多学校流行一种比较的习惯。老师们很原创 2015-08-18 20:47:51 · 338 阅读 · 0 评论 -
HDOJ 1166 敌兵布阵(单点更新+区间求和)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 59945 Accepted Submission(s): 25362Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以原创 2015-08-18 20:58:45 · 308 阅读 · 0 评论 -
hdu5726 GCD (线段树+区间gcd)
GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1587 Accepted Submission(s): 515Problem DescriptionGive you a sequence of N(N原创 2016-07-21 09:30:06 · 2801 阅读 · 1 评论