线段树
文章平均质量分 83
KeyboardPianist
这个作者很懒,什么都没留下…
展开
-
HDU 1556 Color the ball 线段树模板题
#include #define ll long long#define lson l, m, rt<<1#define rson m + 1, r, rt<<1|1#define root 1, N, 1const int maxn = 100005;ll add[maxn<<2];ll sum[maxn<<2];void pushUp(int rt){ sum[rt]原创 2015-10-26 22:23:11 · 439 阅读 · 0 评论 -
HDU3397 Sequence operation(线段树的区间合并)
Sequence operationTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7547 Accepted Submission(s): 2254Problem Descriptionlxhgww g原创 2016-05-12 23:07:55 · 478 阅读 · 0 评论 -
hdu4614 Vases and Flowers(线段树+二分)
Vases and FlowersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2801 Accepted Submission(s): 1096Problem Description Alice is原创 2016-05-12 22:21:05 · 539 阅读 · 0 评论 -
HDU4288 Coder(离线+线段树)
CoderTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4903 Accepted Submission(s): 1880Problem Description In mathematics and c原创 2016-04-15 23:42:40 · 939 阅读 · 0 评论 -
HDU3308 LCIS(线段树区间合并)
LCISTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6095 Accepted Submission(s): 2650Problem DescriptionGiven n integers.You原创 2016-04-15 23:28:56 · 694 阅读 · 0 评论 -
HDU1556 Color the ball(线段树区间更新)
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15182 Accepted Submission(s): 7567Problem DescriptionN个气球排成一排,从左到原创 2016-04-15 23:13:31 · 475 阅读 · 0 评论 -
HDU1828 Picture(线段树+扫描线求周长并)
Picture Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3940 Accepted Submission(s): 2000Problem DescriptionA number of rectang原创 2016-04-15 23:10:06 · 577 阅读 · 0 评论 -
HDU3255 Farming(线段树+扫描线)
FarmingTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1614 Accepted Submission(s): 479Problem DescriptionYou have a big farm,原创 2016-04-15 22:44:07 · 618 阅读 · 0 评论 -
HDU1542 Atlantis(线段树+扫描线)
AtlantisTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10274 Accepted Submission(s): 4381Problem DescriptionThere are several原创 2016-04-15 00:19:50 · 482 阅读 · 0 评论 -
HDU 1754 I Hate It
线段树单点更新和求最大值#include #define lson l, m, rt<<1#define rson m + 1, r, rt<<1|1const int maxn = 200005;int MAX[maxn<<2];int max(int a, int b) {return a>b?a:b;}void pushUp(int rt){ MAX[rt] = ma原创 2015-10-30 01:50:49 · 318 阅读 · 0 评论 -
HDU 3074 Multiply game
#include #include #define ll long long#define lson l, m, rt<<1#define rson m + 1, r, rt<<1|1#define root 1, N, 1#define MOD 1000000007const int maxn = 50005;ll sum[maxn<<2];void update(int l,原创 2015-10-27 22:50:50 · 336 阅读 · 0 评论 -
HDU5493 Queue(线段树)
QueueTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1094 Accepted Submission(s): 567Problem DescriptionN people numbered f原创 2016-10-15 08:21:59 · 345 阅读 · 0 评论