![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
文章平均质量分 81
飘摇的尘土
这个作者很懒,什么都没留下…
展开
-
算法训练 操作格子
算法训练 操作格子 时间限制:1.0s 内存限制:256.0MB问题描述有n个格子,从左到右放成一排,编号为1-n。共有m次操作,有3种操作类型:1.修改一个格子的权值,2.求连续一段格子权值和,3.求连续一段格子的最大值。对于每个2、3操作输出你所求出的结果。输入格式第一行2个整数n,m原创 2015-02-07 14:51:57 · 2134 阅读 · 0 评论 -
hdoj5475An easy problem【线段树】
An easy problemTime Limit: 8000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1149 Accepted Submission(s): 563Problem DescriptionOne day, a原创 2016-01-13 21:22:57 · 502 阅读 · 0 评论 -
hdoj1540Tunnel Warfare【线段树】
Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6184 Accepted Submission(s): 2405Problem DescriptionDuring the原创 2016-02-07 20:27:22 · 477 阅读 · 0 评论 -
hdoj5023A Corrupt Mayor's Performance Art【线段树区间更新】
A Corrupt Mayor's Performance ArtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 1831 Accepted Submission(s): 641Problem Descri原创 2016-02-05 23:49:21 · 1035 阅读 · 0 评论 -
poj2828Buy Tickets【线段树】
Language:DefaultBuy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 17073 Accepted: 8464DescriptionRailway tickets were difficult to buy ar原创 2016-01-11 10:01:32 · 420 阅读 · 0 评论 -
hdoj3308LCIS【线段树区间合并】
LCISTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5782 Accepted Submission(s): 2512Problem DescriptionGiven n integers.Yo原创 2016-01-11 18:07:53 · 590 阅读 · 0 评论 -
hdoj5592ZYB's Premutation【线段树】
ZYB's PremutationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 122 Accepted Submission(s): 42Problem DescriptionZYB has原创 2015-12-05 22:17:48 · 562 阅读 · 0 评论 -
poj2528Mayor's posters【线段树+离散化】
Language:DefaultMayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 52643 Accepted: 15337DescriptionThe citizens of Bytetown, AB, could原创 2015-11-17 21:27:05 · 469 阅读 · 0 评论 -
hdoj1698Just a Hook【线段树区间修改+区间求和】
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24101 Accepted Submission(s): 12062Problem DescriptionIn the game原创 2015-11-18 13:35:08 · 485 阅读 · 0 评论 -
hdoj4325Flowers【线段树+离散化】
FlowersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2603 Accepted Submission(s): 1281Problem DescriptionAs is known to all原创 2015-11-15 22:16:19 · 445 阅读 · 0 评论 -
POJ1151Atlantis【离散化+扫描线+线段树】
Language:DefaultAtlantisTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19315 Accepted: 7335DescriptionThere are several ancient Greek texts that原创 2015-09-15 22:09:53 · 1075 阅读 · 0 评论 -
POJ1389Area of Simple Polygons【离散化+线段树+扫描线】
Language:DefaultArea of Simple PolygonsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3304 Accepted: 1711DescriptionThere are N, 1 <= N <= 1,000原创 2015-09-15 23:41:39 · 610 阅读 · 0 评论 -
nyoj117 求逆序数【线段树】
求逆序数时间限制:2000 ms | 内存限制:65535 KB难度:5描述 在一个排列中,如果一对数的前后位置与大小顺序相反,即前面的数大于后面的数,那么它们就称为一个逆序。一个排列中逆序的总数就称为这个排列的逆序数。现在,给你一个N个元素的序列,请你判断出它的逆序数是多少。比如 1 3 2 的逆序数就是1。输入第一行输入一个整数T表示测试数据的组原创 2015-07-27 16:31:36 · 604 阅读 · 0 评论 -
HDOJ1394 Minimum Inversion Number【树状数组or归并排序】
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13722 Accepted Submission(s): 8371Problem Description原创 2015-07-27 19:52:14 · 590 阅读 · 0 评论 -
POJ3468 A Simple Problem with Integers 【线段树+lazy】
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 74769 Accepted: 23006Case Time Limit: 2000MSDescriptionYou have N i原创 2015-07-27 12:04:20 · 646 阅读 · 0 评论 -
hdoj 敌兵布阵
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51135 Accepted Submission(s): 21410Problem DescriptionC国的死对头A国这段时间正在进行军原创 2015-03-30 23:28:06 · 764 阅读 · 0 评论 -
NYOJ士兵杀敌(三)
士兵杀敌(三)时间限制:2000 ms | 内存限制:65535 KB难度:5描述南将军统率着N个士兵,士兵分别编号为1~N,南将军经常爱拿某一段编号内杀敌数最高的人与杀敌数最低的人进行比较,计算出两个人的杀敌数差值,用这种方法一方面能鼓舞杀敌数高的人,另一方面也算是批评杀敌数低的人,起到了很好的效果。所以,南将军经常问军师小工第i号士兵到第j号原创 2015-02-07 15:48:21 · 844 阅读 · 0 评论 -
BC14hdoj5066&&hdoj5067&&hdoj5068
Harry And Physical TeacherTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 564 Accepted Submission(s): 304Problem DescriptionA原创 2016-02-27 14:23:10 · 412 阅读 · 0 评论