线段树
文章平均质量分 68
benben-wgr
这个作者很懒,什么都没留下…
展开
-
HDU 6315 Naive Operations 线段树+树状数组
Problem Description In a galaxy far, far away, there are two integer sequence a and b of length n. b is a static permutation of 1 to n. Initially a is filled with zeroes. There are two k...原创 2018-07-28 16:38:09 · 264 阅读 · 0 评论 -
Contest Hunter 4302 Interval GCD 0x40「数据结构进阶」例题 算法进阶指南 线段树+树状数组
描述给定一个长度为N的数列A,以及M条指令 (N≤5*10^5, M<=10^5),每条指令可能是以下两种之一:“C l r d”,表示把 A[l],A[l+1],…,A[r] 都加上 d。“Q l r”,表示询问 A[l],A[l+1],…,A[r] 的最大公约数(GCD)。输入格式第一行两个整数N,M,第二行N个整数Ai,接下来M行每条指令的格式如题目描述所示。...原创 2018-07-26 13:07:55 · 437 阅读 · 0 评论 -
POJ - 3264 Balanced Lineup 线段树 ST表模板
For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things ...原创 2018-07-20 23:03:04 · 126 阅读 · 0 评论 -
POJ - 2528 Mayor's posters 线段树+离散化
The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally d...原创 2018-07-29 17:11:25 · 156 阅读 · 0 评论 -
POJ - 3468 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 ...原创 2018-07-22 14:47:03 · 155 阅读 · 0 评论 -
POJ2182 Lost Cows 数状数组+二分 动态找一个序列第k打元素 算法竞赛进阶指南
描述N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' and drank a few too many beers before ...原创 2019-02-02 21:30:17 · 140 阅读 · 0 评论 -
线段树
线段树思维题HDU 4614 Vases and Flowers 二分答案求位置题意:有n个花瓶,初始里面都没有话,现在有二种操作1:op,x,y 表示从第x个花瓶起,遇到花瓶就插入花,当一朵花也没有插入的时候输出no,其它情况输出插入的第一朵花的位置和插入最后一朵花的位置;操作2:op,x,y表示将区间x,y的花瓶里面的花都丢弃;思路:维护懒标记add,和区间和sum,当花瓶里面...原创 2019-08-10 12:40:01 · 214 阅读 · 0 评论