![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
【linux嵌入式】玩家
linux嵌入式玩家
展开
-
D. Multiset(权值线段树 or 树状数组+二分)Educational Codeforces Round 87 (Rated for Div. 2)
题目大意:给你一个长度为nnn的序列,以及qqq次询问qiqiqi,如果qi>0qi>0qi>0,在序列中插入qiqiqi,如果qi<0qi<0qi<0,在序列中删除第∣qi∣|qi|∣qi∣大的数,问你qqq询问后,如果序列中为空,输出000即可,否则输出序列中任意一个数即可。思路:所有操作无非就是删除第kkk大数,增加第kkk大数,我们可以用桶排序的思路建立线段树我们称为它为权值线段树,这个题n=1e6n=1e6n=1e6用权值线段树时间复杂度O(nlogn..原创 2020-05-19 14:48:11 · 183 阅读 · 0 评论 -
F. SUM and REPLACE(线段树+思维+剪枝)
题目大意:先定义一个D(i):i的因子个数D(i):i的因子个数D(i):i的因子个数,现在给你一个序列,你要做两种操作,操作1:将[l,r]中的ai用d(ai)1:将[l,r]中的ai用d(ai)1:将[l,r]中的ai用d(ai)替换。操作2:2:2:求区间[l,r][l,r][l,r]所有数字和。思路:这题与D. The Child and Sequence是一个套路,注意到将d(...原创 2020-05-07 19:03:55 · 225 阅读 · 0 评论 -
D Bash and a Tough Math Puzzle(线段树+思维+剪枝)
题目大意:给你一个序列,你要在这个序列上进行mmm次操作,操作1:l,r,x1:l,r,x1:l,r,x表示判断是否序列区间[l,r][l,r][l,r]中所有数的gcd()=xgcd()=xgcd()=x,如果不等于你可以修改其中一个数的值。操作2:i,y将ai=y2:i,y将ai= y2:i,y将ai=y。思路:注意到q=4e5q=4e5q=4e5也就是说你的所有操作要在O(log...原创 2020-05-07 13:31:12 · 202 阅读 · 0 评论 -
D. The Child and Sequence(线段树+思维)
题目大意:给你一个序列,你要在这个序列上进行操作。操作1:1:1:给定区间[l,r][l,r][l,r],对序列中这个区间的所有数ai,i=[l,r]ai,i=[l,r]ai,i=[l,r]求和。操作2:2:2:给你区间[l,r]和x[l,r]和x[l,r]和x,对i=[l,r],aii=[l,r],aii=[l,r],ai mod xxx。操作3:3:3:给你两个数个数i,k,i,k...原创 2020-05-06 20:32:32 · 446 阅读 · 0 评论 -
Atlantis hdu1542(线段树+扫描线)
AtlantisTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24574 Accepted Submission(s): 9723Problem DescriptionThere are several ancient Gr...原创 2019-11-07 22:36:19 · 169 阅读 · 0 评论 -
Mayor's posters poj2528(离散化+线段树)
Mayor’s postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 90347 Accepted: 25793DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election...原创 2019-11-02 16:02:48 · 149 阅读 · 0 评论 -
Balanced Lineup poj3264(线段树维护max,min)
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 77030 Accepted: 35276Case Time Limit: 2000MSDescriptionFor the daily milking, Farmer John’s N cows (1 ≤ N ≤ 50,000) alwa...原创 2019-11-01 21:02:01 · 148 阅读 · 0 评论 -
hdu1698Just a Hook(线段树+lazy_tag)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 51731 Accepted Submission(s): 24270Problem DescriptionIn the game of DotA, Pu...原创 2019-07-26 17:42:46 · 132 阅读 · 0 评论 -
【poj3468】A Simple Problem with Integers(线段树+lazy_tag)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 162835 Accepted: 50246Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, … , AN. You need t...原创 2019-07-24 22:12:09 · 133 阅读 · 0 评论 -
hdu1754I Hate It(线段树)
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 120514 Accepted Submission(s): 44575Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从...原创 2019-07-24 13:00:18 · 134 阅读 · 0 评论