ACM__线段树
线段树
P1n9
这个作者很懒,什么都没留下…
展开
-
Bubble Cup 11 - Finals [Online Mirror, Div. 2] A. AI robots
地址:http://codeforces.com/contest/1046/problem/A转载:https://blog.csdn.net/Lee_w_j__/article/details/82823266来考虑如何知道两个机器人是否能互相看见。我们可以先按从大到小对机器人进行排序,然后用一个线段树记录第 i 个节点是否有机器人,这样我们就可以通过线段树的区间查询知道,对于第 i 个机...原创 2018-09-26 12:29:02 · 241 阅读 · 0 评论 -
初次学习st表,RMQ算法
这两篇博客都介绍的较好,摘抄记录一下 转载:https://blog.csdn.net/LinzhiQQQ/article/details/81477820 https://blog.csdn.net/qq1169091731/article/details/519814971、算法简介:RMQ算法求解的是区间最值问题,比如求区间最大值例如一个数列 9 5 3 4 1 8 7 ...转载 2018-08-15 20:13:04 · 173 阅读 · 0 评论 -
Q - Get The Treasury 长方体交(扫描线 + 线段树)
Jack knows that there is a great underground treasury in a secret region. And he has a special device that can be used to detect treasury under the surface of the earth. One day he got outside with th...原创 2019-02-11 18:49:34 · 227 阅读 · 0 评论 -
线段树专题---O - 覆盖的面积 扫描线+线段树加深理解
给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.Input输入数据的第一行是一个正整数T(1<=T<=100),代表测试数据的数量.每个测试数据的第一行是一个正整数N(1<=N<=1000),代表矩形的数量,然后是N行数据,每一行包含四个浮点数,代表平面上的一个矩形的左上角坐标和右下角坐标,矩形的上下边和X轴平行,左右边和Y轴平行.坐标的范围从0到100...原创 2019-02-10 15:53:28 · 191 阅读 · 0 评论 -
线段树专题----N - Picture---- 扫描线求多矩形周长并
A number of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical or horizontal. Each rectangle can be partially or totally covered b...原创 2019-02-10 13:24:07 · 257 阅读 · 0 评论 -
线段树专题-----P - Atlantis 扫描线+线段树
AtlantisTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11551 Accepted Submission(s): 4906Problem DescriptionThere are several ancient Gr...原创 2019-02-10 12:39:47 · 187 阅读 · 0 评论 -
线段树专题-----M - 约会安排
寒假来了,又到了小明和女神们约会的季节。 小明虽为屌丝级码农,但非常活跃,女神们常常在小明网上的大段发言后热情回复“呵呵”,所以,小明的最爱就是和女神们约会。与此同时,也有很多基友找他开黑,由于数量实在过于巨大,怎么安排时间便成了小明的一大心事。 我们已知小明一共有T的空闲时间,期间会有很多女神或者基友来找小明。 作为一个操作系统曾经怒考71分的大神,小明想到了一个算法,即“首次适应算...原创 2019-02-09 22:36:44 · 208 阅读 · 0 评论 -
线段树-------L - Vases and Flowers(简单线段树 + 二分)
Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers, she will try to put them in the vases, one flower in one vase. Sh...原创 2018-10-31 20:52:22 · 183 阅读 · 0 评论 -
线段树-------K - Transformation
Yuanfang is puzzled with the question below:There are n integers, a 1, a 2, …, a n. The initial values of them are 0. There are four kinds of operations.Operation 1: Add c to each number between a x...原创 2018-10-22 23:11:25 · 164 阅读 · 0 评论 -
线段树-------J - Assign the task
There is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediate boss of someone,that ...原创 2018-10-22 21:24:10 · 223 阅读 · 0 评论 -
线段树-------I - Tunnel Warfare
During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels lay in a line. Except t...原创 2018-10-19 19:43:19 · 238 阅读 · 0 评论 -
线段树-----H - Can you answer these queries?
A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be marked a value of end...原创 2018-10-19 17:36:20 · 103 阅读 · 0 评论 -
线段树-----C - A Simple Problem with Integers
You have N integers, A1, A2, … , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the su...原创 2018-10-16 21:17:04 · 107 阅读 · 0 评论 -
线段树-----F - Count the Colors
Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segments of different colors you can see at last.Input...原创 2018-10-18 20:02:03 · 181 阅读 · 0 评论 -
Codeforces Round #510 (Div. 2) D. Petya and Array(树状数组或线段树)
地址:http://codeforces.com/contest/1042/problem/D很多题都是不会直接就可以应用一个算法,都会转变一下就变成了熟悉的问题;这道题当把数组变成前缀和sum数组则需要找满足sum[j] - sum[i - 1] < t;如果数据量小的话,直接在对应的前缀和值上进行树状数组即可;但是这题数据比较大,所以先将前缀和值离散化排序一下,sum[j] - t ...原创 2018-09-20 15:53:50 · 388 阅读 · 0 评论 -
无法拯救我的菜----徐州网络赛 G. Trace
地址:https://nanti.jisuanke.com/t/31459线段树做法:讨论其中的宽度: 如果时间正好是升序,高度正好是降序排序,那么每一次都把宽度累加就是最后的答案,我们可以先把高度按照降序排序。排序后不能保证时间是升序的,那么时间大的可以覆盖掉时间小的。但是在高度是降序的排序的情况下只能是排序后在前面的并且时间还大于当前的波浪的时间,当前波浪才会被覆盖掉。 鉴于这点我们需...原创 2018-09-10 21:32:29 · 106 阅读 · 0 评论 -
无法拯救我的菜----南京网络赛 G. Lpl and Energy-saving Lamps
地址:https://nanti.jisuanke.com/t/30996就是一个模拟题,n^2会超时,需要用维护一个最小值线段树,复杂度变成了nlog(n) 注意:被坑的要命的地方,一定要好好理解题意,一次可能会有多个房间的灯泡被换掉, 不是一次一个,有时不要被样例给迷惑了先预处理1~100000月的值,然后按照询问输出#include<bits/stdc++.h>...原创 2018-09-02 20:10:31 · 168 阅读 · 0 评论 -
Codeforces Round #506 (Div. 3) B. Creating the Contest
地址:http://codeforces.com/contest/1029/problem/Bdp思想,这种做法真是麻烦,dp[i] = max(dp[j]) (j是满足a[j] &lt; a[i] &lt;=2 * a[j] )+ 1; 因为n是1e5,所以会超时,j是连续的一段区间,用二分找到区间的左边界,然后用线段树求区间最大值#include&lt;bits/stdc++.h&g...原创 2018-09-02 10:17:52 · 118 阅读 · 0 评论 -
无法拯救我的菜系列------hdu6406
补题持续中………. 参考:线段树做法:https://blog.csdn.net/ccsu_cat/article/details/81711440 莫队做法+单调栈:https://blog.csdn.net/qq_34454069/article/details/81734845Taotao Picks Apples Time Limit: 2000/2000 MS (J...原创 2018-08-17 20:21:41 · 264 阅读 · 0 评论