线段树&树状数组
_lyl
这个作者很懒,什么都没留下…
展开
-
HDU 1166-敌兵布阵(线段树:单点更新,区间求和)
敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 44361 Accepted Submission(s): 18875 Problem Description C国的死对头A国这段时间正在进行军事演原创 2014-08-19 14:22:05 · 824 阅读 · 0 评论 -
HDU 1754-I Hate It(线段树:单点更新,区间最值)
I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 39163 Accepted Submission(s): 15507 Problem Description 很多学校流行一种比较的习惯。原创 2014-08-19 14:48:22 · 924 阅读 · 0 评论 -
POJ 3468-A Simple Problem with Integers(线段树:成段更新,区间求和)
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 62228 Accepted: 19058 Case Time Limit: 2000MS Description You have N i原创 2014-08-20 10:34:55 · 759 阅读 · 0 评论 -
POJ 3264-Balanced Lineup(线段树:单点更新,区间查询)
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 34522 Accepted: 16224 Case Time Limit: 2000MS Description For the daily milking, Farme原创 2014-08-19 12:41:18 · 968 阅读 · 0 评论 -
HDU 3074-Multiply game(线段树:单点更新,区间求积)
Multiply game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1450 Accepted Submission(s): 508 Problem Description Tired of play原创 2014-08-19 16:02:39 · 974 阅读 · 0 评论 -
Poj 2182-Lost Cows(Treap||树状数组+二分答案)
题目链接:点击打开链接 题意:n个牛编号为1-n 现在编号顺序已经打乱,给出a[i] ,a[i] 代表i位置前面有几个小于它的编号,求编号顺序。 倒着推,对于最后一个a[i] , 最后位置编号肯定是 a[i]+1,然后在1-n个编号中删掉当前编号,继续往前推。。即求第 a[i]+1小数,初始容器中有n个数(1-n) ,每求出来一个就删掉。先用平衡树水了一发。。明天写树状数组解法。 #incl原创 2014-12-18 23:21:12 · 889 阅读 · 0 评论