线段树
文章平均质量分 88
CrossDolphin
青春看起来如此完美,没空闲去浪费时间。
展开
-
懒散线段树
链接:http://codevs.cn/problem/1082/1082 线段树练习 3 时间限制: 3 s 空间限制: 128000 KB 题目等级 : 大师 Master题解题目描述 Description给你N个数,有两种操原创 2015-03-18 21:12:25 · 356 阅读 · 0 评论 -
hdu 1255 线段树+离散化+扫描线 (矩形面积交
链接:戳这里覆盖的面积Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.Input输入数据的第一行是一个正整数T(1原创 2016-08-06 18:37:54 · 369 阅读 · 0 评论 -
hdu 5722 线段树+扫描线
链接:戳这里JewelryTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionAfter all the difficulties, Psyche and Cupid are finally gett原创 2016-09-09 11:28:51 · 316 阅读 · 0 评论 -
codevs 3044 线段树+离散化+扫描线 (矩形面积并
链接:戳这里3044 矩形面积求并 时间限制: 1 s 空间限制: 256000 KB 题目等级 : 钻石 Diamond 题解题目描述 Description输入n个矩形,求他们总共占地面积(也就是求一下面积的并)输入描述 Input Description可能有多组数据,读到n=0为止(不超过15组)每组数据第一行一个数n,表示矩原创 2016-08-08 15:06:01 · 397 阅读 · 0 评论 -
hdu 5877 线段树+离散化+DFS
链接:戳这里Weak PairTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionYou are given a rooted tree of N nodes, labeled from 1 to N原创 2016-09-10 22:42:34 · 1630 阅读 · 5 评论 -
Codeforces Round #337 (Div. 2) D (矩形面积并
链接:戳这里D. Vika and Segmentstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVika has an infinite sheet of squared paper. Initial原创 2016-08-10 19:02:55 · 475 阅读 · 0 评论 -
hdu 5828 线段树
链接:戳这里Rikka with SequenceTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying原创 2016-08-11 23:03:21 · 703 阅读 · 0 评论 -
hdu 4092 线段树
链接:戳这里Nice boatTime Limit: 30000/15000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionThere is an old country and the king fell in love with a原创 2016-08-11 23:59:04 · 500 阅读 · 0 评论 -
hdu 4417 可持久化线段树 (区间<=x的数的数量
链接:戳这里Super MarioTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionMario is world-famous plumber. His “burly” figure and amazi原创 2016-08-13 18:39:04 · 1127 阅读 · 0 评论 -
bzoj 3524 可持久化线段树(统计区间数值出现次数
链接:戳这里3524: [Poi2014]CouriersTime Limit: 20 Sec Memory Limit: 256 MB[Submit][Status][Discuss]Description给一个长度为n的序列a。1≤a[i]≤n。m组询问,每次询问一个区间[l,r],是否存在一个数在[l,r]中出现的次数大于(r-l+1)/原创 2016-08-13 21:33:41 · 2361 阅读 · 0 评论 -
hdu 4348 可持久化线段树(区间和
链接:戳这里To the moonTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionBackgroundTo The Moon is a independent game released in N原创 2016-08-15 14:24:52 · 913 阅读 · 0 评论 -
hdu 5820 可持久化线段树
链接:戳这里LightsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionToday is April 1st, 2100. Now Guangzhou is a very very big city. Sin原创 2016-09-08 19:26:19 · 571 阅读 · 0 评论 -
poj 1151 线段树+离散化+扫描线 (矩形面积并
链接:戳这里AtlantisTime Limit: 1000MS Memory Limit: 10000KDescriptionThere are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts e原创 2016-08-06 15:11:43 · 411 阅读 · 0 评论 -
Codeforces Round #365 (Div. 2) D 线段树+离线 (区间内的数有哪些
链接:戳这里D. Mishka and Interesting sumtime limit per test3.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Mishka enjoys programming. Since h原创 2016-08-05 04:48:52 · 560 阅读 · 0 评论 -
BestCoder Round #65 B C D || HDU 5591 5592 5593
B 题意:ZYB在远足中,和同学们玩了一个“数字炸弹”游戏:由主持人心里想一个在[1,N][1,N]中的数字XX,然后玩家们轮流猜一个数字,如果一个玩家恰好猜中XX则算负,否则主持人将告诉全场的人当前的数和XX比是偏大还是偏小,然后猜测的范围就会相应减小,一开始的范围是[1,N][1,N].每个玩家只能在合法的范围中猜测. 现在假设只有两个人在玩这个游戏,并且两个人都已经知道了最后的XX,若两个人原创 2016-03-16 21:10:43 · 368 阅读 · 0 评论 -
BestCoder 74
链接:戳这里A:LCP Array题意:给定一个字符串s=s1s2s3s4...s5,si代表字符(小写字母),知道任意两个相邻的后缀的最长公共前缀长度为一个整数ai,这个意思就是相邻字符相等的个数为ai。问满足该字符串s的种数。思路:样例43 2 1aaaa aaa aa a显然这样的字符串必须是 aaaa (26字符任意一个) 才能满足原创 2016-03-07 16:57:51 · 287 阅读 · 0 评论 -
Codeforces Round #343 (Div. 2) A B C D
链接:戳这里A. Far Relative’s Birthday Caketime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDoor's family is going celebrate Famil Doors's原创 2016-03-20 22:05:25 · 679 阅读 · 0 评论 -
hdu 1698 Just a Hook lazy线段树
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for原创 2016-04-13 21:56:36 · 316 阅读 · 0 评论 -
hdu 1556 lazy线段树
链接:戳这里Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15159 Accepted Submission(s): 7546Problem Descripti原创 2016-04-14 20:18:58 · 297 阅读 · 0 评论 -
poj 3468 A Simple Problem with Integers LAZY线段树
链接:戳这里A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KCase Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds o原创 2016-04-14 22:00:51 · 284 阅读 · 0 评论 -
Codeforces Round #353 (Div. 2) E 线段树+dp
链接:戳这里E. Trains and Statistictime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya commutes by train every day. There are n tr原创 2016-05-23 20:36:54 · 459 阅读 · 0 评论 -
cdoj 1259 线段树+bitset
链接:戳这里昊昊喜欢运动他NN天内会参加M种运动(每种运动用一个[1,m]的整数表示)现在有Q个操作,操作描述如下昊昊把第l天到第r天的运动全部换成了x,x∈[1,m])问昊昊第l天到第r天参加了多少种不同的运动Input输入两个数N, M (1≤N≤105, 1≤M≤100);输入N个数ai(ai∈[1,m]表示在第i天昊昊做了第ai类型的原创 2016-07-28 09:35:20 · 393 阅读 · 0 评论 -
Codeforces Round #275 (Div. 2) D 线段树
链接:戳这里D. Interesting Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe'll call an array of n non-negative integers a[1],原创 2016-07-29 12:19:55 · 625 阅读 · 0 评论 -
Codeforces Round #271 (Div. 2) F 线段树+pair
链接:戳这里F. Ant colonytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMole is hungry again. He found one ant colony, consisting of原创 2016-07-29 22:18:24 · 575 阅读 · 0 评论 -
Codeforces Round #271 (Div. 2) E 离散化+线段树
链接:戳这里E. Pillarstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMarmot found a row with n pillars. The i-th pillar has the heig原创 2016-07-31 14:43:07 · 424 阅读 · 0 评论 -
hdu 5091 线段树+扫描线思想
链接:戳这里Beam CannonTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionRecently, the γ galaxies broke out Star Wars. Each planet i原创 2016-10-13 19:51:22 · 437 阅读 · 0 评论