数据结构-线段树//树状数组
Mitsuha_
Rush to the dead summer
展开
-
华南理工大学“三七互娱杯”程序设计竞赛-B: HRY and fibonacci(线段树+矩阵快速幂)
链接:https://ac.nowcoder.com/acm/contest/874/B时间限制:C/C++ 5秒,其他语言10秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述HRY is a pupil. He has just learned about Fibonacci sequence recently, and ...原创 2019-04-28 14:18:53 · 257 阅读 · 0 评论 -
Codeforces-1114F:Please, another Queries on Array?(线段树)
F. Please, another Queries on Array?time limit per test 5.5 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputYou are given an array a1,a2,…,an.a_1,a_2,…,a_n.a1...原创 2019-02-12 19:35:34 · 408 阅读 · 0 评论 -
ZOJ-4082:Little Sub and his Geometry Problem(二分+BIT)
题目链接思路:对于每个询问来说,每一个uuu,只存在一个vvv使得F(u,v)=CiF(u,v)=C_iF(u,v)=Ci。那么提前将点按xxx坐标排好序,枚举uuu,将x≤ux\le ux≤u的点放入BIT,用树状数组记录点的个数及x+yx+yx+y的值,然后二分vvv。二分时用树状数组计算F(u,v)F(u,v)F(u,v)。PS:当Ci>2∗1010C_i&g...原创 2019-01-19 17:39:52 · 456 阅读 · 8 评论 -
2018-2019 ICPC, NEERC, Northern Eurasia Finals(F,K)
2018-2019 ICPC, NEERC, Northern Eurasia FinalsProblem F:Fractions思路:看懂题意之后,相当于求解x1n+x2n+x3n+⋯+xkn=n−1n\frac {x_1}{n}+\frac {x_2}{n}+\frac {x_3}{n}+\dots +\frac {x_k}{n}=\frac {n-1}{n}nx1+nx2+nx3...原创 2018-12-03 13:56:01 · 924 阅读 · 0 评论 -
Codeforces-1062E:Company(LCA+线段树)
E. Companytime limit per test 2 secondsmemory limit per test 256 megabytesinputstandard inputoutputstandard outputThe company X has n employees numbered from 1 through n. Each employee u has a di...原创 2018-11-17 20:28:37 · 850 阅读 · 0 评论 -
Codeforces-1076E:Vasya and a Tree(树状数组)
E. Vasya and a Treetime limit per test 2 secondsmemory limit per test 256 megabytesinputstandard inputoutputstandard outputVasya has a tree consisting of n vertices with root in vertex 1. At firs...原创 2018-11-13 13:14:42 · 422 阅读 · 0 评论 -
Codeforces-Gym 101505G:Orchard Division(二分+树状数组)
传送门是什么东西?思路:二分矩形面积。但是2维怎么二分呢?那么一维枚举,另一维二分。即枚举矩形的宽,二分高度。首先把所有的点按xxx递增排序,然后遍历所有的点,以这个点的xxx坐标作为矩形的边界,然后二分高度hhh,判断有多少个点在这个矩形内。如何判断有多少个点在这个矩形内呢?把所有点的yyy值离散化,每次遍历到这个点,就按yyy值插入树状数组。 统计的时候用树状数组统计...原创 2018-08-30 18:38:37 · 195 阅读 · 0 评论 -
HDU-6230:Palindrome(manacher+树状数组)
Palindrome Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem Description Alice like strings, especially long strings. For each string, she has a special ev...原创 2018-08-27 20:40:25 · 241 阅读 · 0 评论 -
Wannafly挑战赛22-D:整数序列(线段树)
链接:https://www.nowcoder.com/acm/contest/160/D时间限制:C/C++ 2秒,其他语言4秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 给出一个长度为nnn的整数序列a1,a2,...,ana1,a2,...,ana_1,a_2,...,a_n,进行mmm次操作,操作分为两...原创 2018-08-18 20:41:46 · 349 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第九场)H:Prefix Sum(组合数学相关)
链接:https://www.nowcoder.com/acm/contest/147/H时间限制:C/C++ 3秒,其他语言6秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 Niuniu has learned prefix sum and he found an interesting about prefi...原创 2018-08-17 11:25:00 · 679 阅读 · 1 评论 -
牛客网暑期ACM多校训练营(第六场)I:Team Rocket(线段树)
链接:https://www.nowcoder.com/acm/contest/144/I时间限制:C/C++ 4秒,其他语言8秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 There are n trains running between Kanto and Johto region. Assuming t...原创 2018-08-06 09:52:49 · 218 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第五场)F:take(树状数组)
链接:https://www.nowcoder.com/acm/contest/143/F时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 Kanade has nnn boxes , the i-th box has p[i]p[i]p[i] probability to ha...原创 2018-08-02 22:24:06 · 149 阅读 · 0 评论 -
2018 Multi-University Training Contest 2-1007:Naive Operations(线段树)
Naive Operations Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 502768/502768 K (Java/Others) ...原创 2018-07-25 20:05:46 · 274 阅读 · 0 评论 -
CDOJ-1944:Letter Kingdom(DFS预处理+线段树)
Letter Kingdom Time Limit: 2000 MS Memory Limit: 256 MBOne day, you had a dream. In the dream, you got trapped in the Letter Kingdom. Two soldiers caught you, and brought you to the front of th...原创 2018-07-15 12:42:02 · 448 阅读 · 0 评论 -
2018年全国多校算法寒假训练营练习比赛(第五场)-E:情人节的电灯泡(二维树状数组)
时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 32768K,其他语言65536K64bit IO Format: %lld题目描述情人节到了,小芳和小明手牵手,打算过一个完美的情人节,但是小刚偏偏也来了,当了一个明晃晃的电灯泡,小明很尴尬,就和小刚说,我交给你个任务,你完成了我俩就带你玩,否则你就回家吧。小刚很有当单身狗的觉悟,他坚决不想让小明过好情人节,同为单身狗的你能帮帮他吗?...原创 2018-03-02 12:22:27 · 331 阅读 · 0 评论 -
Codeforces-920F:SUM and REPLACE(set+树状数组)
Codeforces-920F:SUM and REPLACE(set+树状数组)Let D(x) be the number of positive divisors of a positive integer x. For example, D(2) = 2 (2 is divisible by 1 and 2), D(6) = 4 (6 is divisible by 1, 2, 3 and 6).You are given an array a of n integers. You have to原创 2018-02-03 12:40:38 · 430 阅读 · 0 评论 -
UESTC - 425:Defense Lines(排序+线段树)
UESTC - 425:Defense Lines(排序+线段树)After the last war devastated your country, you - as the king of the land of Ardenia - decided it was high time to improve the defense of your capital city. A part of your fortification is a line of mage towers, starting ne原创 2017-11-21 23:19:51 · 235 阅读 · 0 评论 -
Codeforces-191C: Fools and Roads(LCA)
Codeforces-191C: Fools and Roads(LCA)They say that Berland has exactly two problems, fools and roads. Besides, Berland has n cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland,原创 2017-11-16 22:42:16 · 847 阅读 · 0 评论 -
Codeforces-652D : Nested Segments(线段树)
Codeforces-652D : Nested Segments(线段树)You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.原创 2017-11-10 17:48:51 · 296 阅读 · 0 评论 -
Codeforces-830B:Cards Sorting(树状数组+线段树)
Codeforces-830B:Cards Sorting(树状数组+线段树)Vasily has a deck of cards consisting of n cards. There is an integer on each of the cards, this integer is between 1 and 100 000, inclusive. It is possible that some cards have the same integers on them.Vasily deci原创 2017-11-05 11:53:12 · 461 阅读 · 0 评论 -
Codeforces-877E:Danil and a Part-time Job(DFS序列+线段树)
Codeforces-877E:Danil and a Part-time Job(DFS序列+线段树)Danil decided to earn some money, so he had found a part-time job. The interview have went well, so now he is a light switcher.Danil works in a rooted tree (undirected connected acyclic graph) with n ve原创 2017-10-26 08:46:45 · 1949 阅读 · 0 评论 -
Codeforces-242E:XOR on Segment(20个线段树)
Codeforces-242E:XOR on Segment(20个线段树)You've got an array a, consisting of n integers a1, a2, ..., an. You are allowed to perform two operations on this array:Calculate the sum of current array elements on the segment [l, r], that is, count value al + al原创 2017-10-15 22:41:16 · 380 阅读 · 0 评论 -
hihocoder#1116 : 计算(线段树)
hihocoder#1116 : 计算(线段树)现在有一个有n个元素的数组a1, a2, ..., an。记f(i, j) = ai * ai+1 * ... * aj。初始时,a1 = a2 = ... = an = 0,每次我会修改一个ai的值,你需要实时反馈给我 ∑1 <= i <= j <= n f(i, j)的值 mod 10007。原创 2017-10-08 10:41:07 · 330 阅读 · 0 评论 -
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛: F. Overlapping Rectangles(线段树)
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛: F. Overlapping Rectangles(线段树)There are nn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with each other, and the overlapped areas of these re原创 2017-09-24 18:08:24 · 349 阅读 · 0 评论 -
WUST OJ 1593: Count Zeros(线段树)
WUST OJ 1593: Count Zeros(线段树)Blue Wang is addicted in Math. He calculates all kinds of math problems all day. The answer may be very large, but he writes it on the paper by hand.Sometimes it’s boring because he must write many zeros at the tail of the an原创 2017-09-21 22:35:34 · 359 阅读 · 0 评论 -
hihocoder#1576 : 子树中的最小权值(dfs序+线段树)
hihocoder#1576 : 子树中的最小权值(dfs序+线段树)给定一棵N个节点的树,编号1~N。其中1号节点是根,并且第i个节点的权值是Vi。针对这棵树,小Hi会询问小Ho一系列问题。每次小Hi会指定一个节点x,询问小Ho以x为根的子树中,最小的权值是多少。为了增加难度,小Hi可能随时改变其中每个节点的权值。你能帮助小Ho准确、快速的回答小Hi的问题吗?原创 2017-09-20 12:54:15 · 655 阅读 · 0 评论 -
HDU-5475:An easy problem(线段树)
HDU-5475:An easy problem(线段树)One day, a useless calculator was being built by Kuros. Let's assume that number X is showed on the screen of calculator. At first, X = 1. This calculator only supports two types of operation.1. multiply X with a number.2. di原创 2017-09-13 15:12:42 · 309 阅读 · 0 评论 -
hihocoder#1336 : Matrix Sum(二维线段树)
hihocoder#1336 : Matrix Sum(二维线段树)You are given an N × N matrix. At the beginning every element is 0. Write a program supporting 2 operations: 1. Add x y value: Add value to the element Axy. (Subscripts starts from 02. Sum x1 y1 x2 y1: Return the sum o原创 2017-09-08 09:26:33 · 688 阅读 · 0 评论 -
Codeforces-846D:Monitor(二维线段树)
Codeforces-846D:Monitor(二维线段树)Recently Luba bought a monitor. Monitor is a rectangular matrix of size n × m. But then she started to notice that some pixels cease to work properly. Luba thinks that the monitor will become broken the first moment when it co原创 2017-09-07 12:43:41 · 636 阅读 · 0 评论 -
HDU - 1166 :敌兵布阵
HDU - 1166 :敌兵布阵 C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视。原创 2017-08-22 09:14:07 · 329 阅读 · 0 评论 -
POJ - 2352 :Stars
POJ - 2352 :Stars Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the right of the given star. As原创 2017-08-21 22:00:02 · 312 阅读 · 0 评论 -
ZOJ-3453:Doraemon's Sweet Bullet
ZOJ-3453:Doraemon's Sweet BulletDoraemon likes to shoot his enemies with sweet bullets.n "enemies" stand in a line, each with a life value li (the index i increases from left to right side and starts from 1). Each time Doraemon shoots a sweet bullet from原创 2017-08-18 14:03:53 · 365 阅读 · 0 评论