![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
┠──>树状数组线段树
hhfgeg
这个作者很懒,什么都没留下…
展开
-
hoj 2275 Number sequence
Number sequenceGiven a number sequence which has N element(s), please calculate the number of different collocation for three number Ai, Aj, Ak, which satisfy that Ai Ak and i InputThe fi原创 2014-07-15 16:15:31 · 1006 阅读 · 0 评论 -
湖南省第九届大学生计算机程序设计竞赛 高桥和低桥
高桥和低桥Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 358 Solved: 60Description有个脑筋急转弯是这样的:有距离很近的一高一低两座桥,两次洪水之后高桥被淹了两次,低桥却只被淹了一次,为什么?答案是:因为低桥太低了,第一次洪水退去之后水位依然在低桥之上,所以不算“淹了两次”。举例说明:假定高原创 2014-07-15 15:15:07 · 1575 阅读 · 0 评论 -
hdu 1166 敌兵布阵
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40097 Accepted Submission(s): 16932Problem DescriptionC国的死对头A国这段时间正在进行军事演原创 2014-07-14 20:27:05 · 1572 阅读 · 0 评论 -
HOJ 1867 经理的烦恼
经理的烦恼My Tags (Edit) Source : HCPC 2005 Spring Time limit : 2 sec Memory limit : 32 MSubmitted : 2588, Accepted : 608Jer原创 2014-07-15 10:47:34 · 1162 阅读 · 0 评论 -
hdu 1556 Color the ball
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8455 Accepted Submission(s): 4329Problem DescriptionN个气球排成一排,从左原创 2014-07-15 15:28:40 · 1154 阅读 · 0 评论 -
BestCoder Round #2 1001 TIANKENG’s restaurant
TIANKENG’s restaurantTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionTIANKEN原创 2014-07-27 21:36:41 · 1133 阅读 · 0 评论 -
HDU 1754 I Hate It
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 36007 Accepted Submission(s): 14178Problem Description很多学校流行一种比较的习惯。原创 2014-07-16 21:26:41 · 948 阅读 · 0 评论 -
POJ 3264 Balanced Lineup
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 33094 Accepted: 15552Case Time Limit: 2000MSDescriptionFor the daily milking, Far原创 2014-07-17 10:12:58 · 990 阅读 · 0 评论 -
POJ 3368 Frequent values
Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13051 Accepted: 4792DescriptionYou are given a sequence of n integers a1 , a2 , ... , a原创 2014-07-17 15:49:51 · 1220 阅读 · 0 评论 -
POJ 1195 Mobile phones
Mobile phonesTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 14329Accepted: 6660DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere are原创 2014-07-16 09:20:52 · 982 阅读 · 0 评论 -
树状数组
树状数组第01讲 什么是树状数组?树状数组用来求区间元素和,求一次区间元素和的时间效率为O(logn)。有些同学会觉得很奇怪。用一个数组S[i]保存序列A[]的前i个元素和,那么求区间i,j的元素和不就为S[j]-S[i-1],那么时间效率为O(1),岂不是更快?但是,如果题目的A[]会改变呢?例如:我们来定义下列问题:我们有n个盒子。可能的操作为1原创 2014-07-15 19:17:43 · 1068 阅读 · 0 评论 -
POJ 2299 Ultra-QuickSort
Ultra-QuickSortDescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence eleme原创 2014-07-15 16:32:28 · 762 阅读 · 0 评论