数据结构-线段树(树状数组)
文章平均质量分 87
普通网友
这个作者很懒,什么都没留下…
展开
-
hdu3564(二分+线段树)
Another LISTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 936 Accepted Submission(s): 328Problem DescriptionThere is a sequence原创 2013-09-12 22:49:41 · 898 阅读 · 0 评论 -
hdu2492(树状数组+离线处理)
Ping pongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3160 Accepted Submission(s): 1177Problem DescriptionN(3<=N<=20000) ping原创 2013-09-06 17:21:26 · 1082 阅读 · 0 评论 -
hdu4031(线段树+区间更新)
AttackTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1454 Accepted Submission(s): 403Problem DescriptionToday is the 10th Annual原创 2013-09-08 20:47:15 · 957 阅读 · 0 评论 -
hdu3743(线段树+离散化)
Frosh Week Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1388 Accepted Submission(s): 441Problem DescriptionDuring Frosh Week,原创 2013-09-11 11:09:33 · 903 阅读 · 0 评论 -
hdu4630(线段树)
No Pain No GameTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1166 Accepted Submission(s): 483Problem DescriptionLife is a game,原创 2013-08-23 22:45:57 · 1051 阅读 · 0 评论 -
hdu4614(二分法+线段树)
Vases and FlowersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 811 Accepted Submission(s): 293Problem Description Alice is so原创 2013-07-27 14:26:32 · 858 阅读 · 0 评论 -
HDU2836(线段树和二分法+dp)
TraversalTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 599 Accepted Submission(s): 206Problem DescriptionI arrive at a big lake转载 2013-06-05 15:26:41 · 819 阅读 · 0 评论 -
HDU1540(线段树)
Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3047 Accepted Submission(s): 1162Problem DescriptionDuring the War转载 2013-06-03 20:35:22 · 718 阅读 · 0 评论 -
poj2528(线段树)
在此申明,本题的代码是暑期学习时北大老师给的,我只是谈谈自己的理解。首先本题的海报张数1 i 很容易想到用hash暴力枚举,但结果很可能超时。 可以换个角度尝试用线段树做:以每个端点为一区间,两个端点之间的部分也为一区间,这样最多会有不超过10000*3个单位区间每个单位区间数据结构为:struct CNode { int L,R; bo原创 2013-07-13 15:51:37 · 715 阅读 · 0 评论 -
POJ3468(线段树+延迟更新)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 43776 Accepted: 12806Case Time Limit: 2000MSDescriptionYou have N i原创 2013-06-04 08:43:15 · 595 阅读 · 0 评论 -
poj4047(线段树+延迟更新)
//线段树延迟更新//将连续相邻的k个数据的和看成一个元素,建立线段树;交换、替代两种操作都可以统一成加法操作 //-------加法//若当前加法操作的区间和当前所在节点的左右区间相同,则只修改延迟标记adi,和当前区间的最大值sum;若不一致,才开始向下执行加法操作,同时修改最大值 //------查询//若当前查询的区间和当前所在区间相同,则直接返回结果;若不一致原创 2013-06-04 13:14:36 · 690 阅读 · 0 评论 -
poj2299(逆序数+线段树)
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 34679 Accepted: 12466DescriptionIn this problem, you have to analyze a particular sorting a原创 2013-08-29 21:03:25 · 1442 阅读 · 0 评论 -
poj2777(延迟更新+线段树)
Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31475 Accepted: 9433DescriptionChosen Problem Solving and Program design as an optional course,原创 2013-08-26 23:14:02 · 768 阅读 · 0 评论 -
poj2182(二分+树状数组)
Lost CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8341 Accepted: 5320DescriptionN (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a原创 2013-08-27 17:40:39 · 896 阅读 · 0 评论 -
poj1195(二维树状数组)
Mobile phonesTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 12554 Accepted: 5787DescriptionSuppose that the fourth generation mobile phone base stations原创 2013-07-16 18:53:44 · 636 阅读 · 0 评论 -
九度1407(线段树+延迟更新)
给定一个大小为N 的整数数组array,我们定义两种操作:1) Add(L, R, W)。即将子数组[L, R]中的元素,都累加一个整数W。2) Min(L, R)。即返回子数组[L, R]之中,最小的一个元素的值。其中L和R为数组的下标,且从0开始计数。当数组下标L > R时,我们认为这个子数组的元素包含array[L], array[L+1], … arra原创 2013-07-16 09:28:34 · 659 阅读 · 0 评论 -
poj32643(线段树)
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 27962 Accepted: 13136Case Time Limit: 2000MSDescriptionFor the daily milking, Farme原创 2013-07-16 18:34:23 · 661 阅读 · 0 评论 -
poj2352(线段树或树状数组)
StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26238 Accepted: 11448DescriptionAstronomers often examine star maps where stars are represented by po原创 2013-07-16 21:28:07 · 804 阅读 · 0 评论 -
hdu3333(hash+树状数组)
Turing TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2578 Accepted Submission(s): 878Problem DescriptionAfter inventing Tur原创 2013-07-27 19:09:25 · 864 阅读 · 0 评论 -
hdu4417(离散化+树状数组)
Super MarioTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1435 Accepted Submission(s): 688Problem DescriptionMario is world-famo原创 2013-07-28 17:44:05 · 1284 阅读 · 0 评论 -
hdu4288(线段树)
CoderTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2096 Accepted Submission(s): 858Problem Description In mathematics and co原创 2013-07-28 00:18:17 · 734 阅读 · 0 评论 -
hdu4638(离线算法+线段树)
GroupTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 944 Accepted Submission(s): 510Problem DescriptionThere are n men ,every man原创 2013-08-23 19:15:54 · 1795 阅读 · 0 评论 -
hdu2852(二分枚举+树状数组)
KiKi's K-NumberTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2254 Accepted Submission(s): 1024Problem DescriptionFor the k-th n原创 2013-09-12 13:39:25 · 728 阅读 · 0 评论 -
hdu3874(离线思想+线段树)
NecklaceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2034 Accepted Submission(s): 733Problem DescriptionMery has a beautiful原创 2013-08-27 20:41:49 · 871 阅读 · 0 评论 -
HDU5592(线段树+二分)
本题要求根据每个位置逆序数的累计个数,还原数列。可以从后往前推,求出当前位置元素ans[i]的前面有多少元素比他大或比他小,ans[i]=log[i]-log[i-1,注意边界的处理,但时,只知道前面比他大或比他小的元素是不能准确定位元素大小的,还得知道后面比他大或比他小的元素。1)、前面比他大或小的元素个数可以通过反向遍历O(n)求出。2)、后面比他大或小的元素个数可以通过在某个数组中标价,然后通过二分结合某个快速求区间和的算法-线段树得出,时间复杂度O(log(N))^2 这样一来,总的时原创 2016-01-09 00:25:27 · 855 阅读 · 0 评论