区间合并
wJs9528-1
这个作者很懒,什么都没留下…
展开
-
POJ 3667 Hotel 区间合并+区间更新
Hotel Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description The cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and e原创 2015-08-17 10:33:17 · 660 阅读 · 0 评论 -
Hdu 3397 Sequence operation 区间合并+区间更新+翻转操作
Sequence operation Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description lxhgww got a sequence contains n characters which are all '0's or '1's. We h原创 2015-08-17 10:44:01 · 487 阅读 · 0 评论 -
HDU 2871 Memory Control 区间合并+区间更新
Memory Control Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description Memory units are numbered from 1 up to N. A sequence of memory units is called a m原创 2015-08-17 15:36:22 · 439 阅读 · 0 评论 -
HDU 1828 Picture (线段树扫描线求周长并 区间合并)
扫描线求每次的上下已有边长,同时区间合并记录边长的分布情况乘以高度差求出高度的变长 #include #include #include #include #include #include #include #include #include #include //#pragma comment(linker, "/STACK:1024000000,1024000000"); usi原创 2016-02-29 19:15:18 · 459 阅读 · 0 评论 -
HDU 4046 Panda (分块 或 线段树区间合并)
题面挺美的 题意:给出一个字符串,两种操作1.询问区间[l,r]内wbw有多少个(可重叠)2.将位置x的字符改为c 题解:分块和线段树都可以搞,分块很好解释,只需要单独处理边界问题。线段树区间合并需要将每次询问的区间拿出来单独处理一次。分块:#include<cstring> #include<string> #include<iostream> #include<queue> #include原创 2016-10-31 22:52:43 · 356 阅读 · 0 评论