随笔分类 -  数据结构--树状数组

1
poj 3321Apple Tree
摘要：Apple Tree Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Apple Tree Submit Status Description There is an apple t 阅读全文
posted @ 2017-03-27 20:14 勿忘初心0924 阅读(294) 评论(0) 推荐(0) 编辑
Minimum Inversion Number
摘要：Minimum Inversion Number Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description The inversion number of a give 阅读全文
posted @ 2017-03-24 14:38 勿忘初心0924 阅读(246) 评论(0) 推荐(0) 编辑
Matrix
摘要：Matrix Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Matrix Submit Status Description Given an N*N matrix A, whos 阅读全文
posted @ 2017-03-17 20:52 勿忘初心0924 阅读(364) 评论(0) 推荐(0) 编辑
Increasing Speed Limits
摘要：Increasing Speed Limits Problem Description You were driving along a highway when you got caught by the road police for speeding. It turns out that th 阅读全文
posted @ 2017-03-02 22:20 勿忘初心0924 阅读(248) 评论(0) 推荐(0) 编辑
Stars（二维树状数组）
摘要：Stars Problem Description Yifenfei is a romantic guy and he likes to count the stars in the sky.To make the problem easier,we considerate the sky is a 阅读全文
posted @ 2017-02-14 21:58 勿忘初心0924 阅读(976) 评论(0) 推荐(0) 编辑
Life is a Line
摘要：Life is a Line Problem Description There is a saying: Life is like a line, some people are your parallel lines, while others are destined to meet you. 阅读全文
posted @ 2017-02-13 18:06 勿忘初心0924 阅读(377) 评论(0) 推荐(0) 编辑
Disharmony Trees
摘要：Disharmony Trees Problem Description One day Sophia finds a very big square. There are n trees in the square. They are all so tall. Sophia is very int 阅读全文
posted @ 2016-12-05 22:34 勿忘初心0924 阅读(385) 评论(0) 推荐(0) 编辑
KiKi's K-Number
摘要：KiKi's K-Number Problem Description For the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a 阅读全文
posted @ 2016-11-28 15:42 勿忘初心0924 阅读(291) 评论(0) 推荐(0) 编辑
树状数组总结
摘要：树状数组 数据结构知识点1-树状数组 树状数组的用途就是维护一个数组，重点不是这个数组，而是要维护的东西，最常用的求区间和问题，单点更新。但是某些大牛YY出很多神奇的东西，完成部分线段树能完成的功能，比如区间更新，区间求最值问题。 树状数组当然是跟树有关了，但是这个树是怎么构建的呐？这里就不得不感叹 阅读全文
posted @ 2016-09-29 20:30 勿忘初心0924 阅读(7671) 评论(0) 推荐(2) 编辑
LA4329:Ping pong(树状数组)
摘要：Description N(3N20000) ping pong players live along a west-east street(consider the street as a line segment). Each player has a unique skill rank. To 阅读全文
posted @ 2016-09-27 18:41 勿忘初心0924 阅读(180) 评论(0) 推荐(0) 编辑
HDU 3333 Turing Tree
摘要：Turing Tree Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4671 Accepted Submission(s): 1649 Pro 阅读全文
posted @ 2016-09-22 21:23 勿忘初心0924 阅读(217) 评论(0) 推荐(0) 编辑
HDU 3584 Cube（三位树状数组）
摘要：Cube Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1949 Accepted Submission(s): 1013 Problem D 阅读全文
posted @ 2016-09-22 09:43 勿忘初心0924 阅读(171) 评论(0) 推荐(0) 编辑
HDU 1892 See you~（二维树状数组）
摘要：See you~ Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4753 Accepted Submission(s): 1518 Proble 阅读全文
posted @ 2016-09-21 21:35 勿忘初心0924 阅读(206) 评论(0) 推荐(0) 编辑
HDU 4267 A Simple Problem with Integers（树状数组区间更新）
摘要：A Simple Problem with Integers Time Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5402 Accepted Subm 阅读全文
posted @ 2016-09-20 19:06 勿忘初心0924 阅读(164) 评论(0) 推荐(0) 编辑
POJ 3468 A Simple Problem with Integers（树状数组区间更新） 续
摘要：这个题刚开始的时候是套模板的，并没有真的理解什么树状数组的区间更新，这几天想了一下，下面是总结： 区间更新这里引进了一个数组delta数组，delta[i]表示区间 [i, n] 的共同增量，每次你需要更新的时候只需要更新delta数组就行了，因为每段区间更新的数都记录在这个数组中，那怎么查询前缀和 阅读全文
posted @ 2016-09-19 22:26 勿忘初心0924 阅读(143) 评论(0) 推荐(0) 编辑
POJ 3468 A Simple Problem with Integers（树状数组区间更新）
摘要：A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 97217 Accepted: 30358 Case Time Limit: 2000MS Description Y 阅读全文
posted @ 2016-09-17 22:12 勿忘初心0924 阅读(149) 评论(0) 推荐(0) 编辑
HDU 4325 Flowers（树状数组）
摘要：Flowers Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3150 Accepted Submission(s): 1549 Problem 阅读全文
posted @ 2016-09-16 21:23 勿忘初心0924 阅读(151) 评论(0) 推荐(0) 编辑
HDU 1166 敌兵布阵（树状数组）
摘要：敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 78528 Accepted Submission(s): 33171 Problem 阅读全文
posted @ 2016-09-13 11:55 勿忘初心0924 阅读(148) 评论(0) 推荐(0) 编辑
HDU 1556 Color the ball
摘要：Color the ball Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17276 Accepted Submission(s): 8640 阅读全文
posted @ 2016-09-11 16:08 勿忘初心0924 阅读(99) 评论(0) 推荐(0) 编辑
poj 2352 Stars
摘要：Stars Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 42707 Accepted: 18587 Description Astronomers often examine star maps where stars are 阅读全文
posted @ 2016-09-08 21:39 勿忘初心0924 阅读(156) 评论(0) 推荐(0) 编辑

1