
线段树
文章平均质量分 86
灰黑飞
用智慧的程序写出美好的未来。
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
poj 3468 线段树区间更新
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 47486 Accepted: 13966Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. You nee原创 2014-07-20 16:18:06 · 388 阅读 · 0 评论 -
hdu 4578 线段树lazy标记
TransformationTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 65535/65536 K (Java/Others)Total Submission(s): 3004 Accepted Submission(s): 725Problem DescriptionYuanfang is puzzled w原创 2014-11-13 10:22:31 · 497 阅读 · 0 评论 -
bzoj 1798 线段树 双lazy标记
1798: [Ahoi2009]Seq 维护序列seqTime Limit: 30 Sec Memory Limit: 64 MBSubmit: 2645 Solved: 984[Submit][Status]Description老师交给小可可一个维护数列的任务,现在小可可希望你来帮他完成。 有长为N的数列,不妨设为a1,a2,…,aN 。有如下三种操作形式: (1)原创 2014-11-12 12:37:14 · 613 阅读 · 0 评论 -
bzoj 1012 简单的线段树
1012: [JSOI2008]最大数maxnumberTime Limit: 3 Sec Memory Limit: 162 MBSubmit: 4273 Solved: 1918[Submit][Status]Description现在请求你维护一个数列,要求提供以下两种操作: 1、 查询操作。语法:Q L 功能:查询当前数列中末尾L个数中的最大的数,并输出这个数的原创 2014-11-12 16:26:45 · 495 阅读 · 0 评论 -
hdu 3971
Play With SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 418 Accepted Submission(s): 211Problem DescriptionWhen the gir原创 2014-09-04 17:46:02 · 431 阅读 · 0 评论 -
hdu 4348 可持续化线段树
To the moonTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2423 Accepted Submission(s): 480Problem DescriptionBackgroundTo The原创 2014-08-18 19:31:49 · 645 阅读 · 0 评论 -
hdu 5023 线段树
两种操作,一种更新区间,一种询问原创 2014-09-22 15:32:49 · 334 阅读 · 0 评论 -
hdu 4288 线段树
CoderTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2884 Accepted Submission(s): 1155Problem Description In mathematics and c原创 2014-08-11 13:44:25 · 412 阅读 · 0 评论 -
hdu 4973 线段树
A simple simulation problem.Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 698 Accepted Submission(s): 274Problem DescriptionTh原创 2014-09-06 17:51:41 · 430 阅读 · 0 评论 -
hdu 4893 线段树
Wow! Such Sequence!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 620 Accepted Submission(s): 191Problem DescriptionRecentl原创 2014-07-29 20:50:59 · 477 阅读 · 0 评论 -
hdu 2795
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9594 Accepted Submission(s): 4270Problem DescriptionAt the entrance原创 2014-07-04 17:36:29 · 338 阅读 · 0 评论 -
poj 2828 Buy Tickets
Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 12225 Accepted: 6036DescriptionRailway tickets were difficult to buy around the Lunar New Yea原创 2014-07-04 21:39:20 · 412 阅读 · 0 评论 -
poj 1177 线段树+离散化+扫描线 求矩形的周长和
PictureTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 10230 Accepted: 5422DescriptionA number of rectangular posters, photographs and other pictures of原创 2014-07-25 15:53:19 · 888 阅读 · 0 评论 -
poj 1151 线段树扫描线求图形面积
AtlantisTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16975 Accepted: 6468DescriptionThere are several ancient Greek texts that contain descriptions o原创 2014-07-23 20:04:49 · 545 阅读 · 0 评论 -
hdu 1698 线段树区间更新
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16251 Accepted Submission(s): 8087Problem DescriptionIn the game o原创 2014-07-20 16:07:00 · 459 阅读 · 0 评论 -
poj 2886
Who Gets the Most Candies?Time Limit: 5000MS Memory Limit: 131072KTotal Submissions: 9586 Accepted: 2917Case Time Limit: 2000MSDescripti原创 2014-07-20 11:40:49 · 414 阅读 · 0 评论 -
poj 2528 线段树离散化+区间更新
Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 40456 Accepted: 11766DescriptionThe citizens of Bytetown, AB, could not stand that the ca原创 2014-07-21 14:12:01 · 576 阅读 · 0 评论 -
hdu 5091 线段树+扫描线
Beam CannonTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 205 Accepted Submission(s): 79Problem DescriptionRecently, the γ galaxies br原创 2014-11-04 11:18:22 · 422 阅读 · 0 评论