ACM - 线段树
LP_Cong
Python, Qt C++ Developer ACMer https://github.com/Linzecong
展开
-
HDU - 3974 Assign the task
解题思路:DFS把树转换成区间,然后可以通过线段树去维护这些区间,从而变为线段树问题。原创 2017-06-04 15:19:55 · 265 阅读 · 0 评论 -
ZOJ - 4053 Couleur(ACM-ICPC 2018 青岛赛区网络预赛 G)(主席树+线段树+启发式暴力)
CouleurTime Limit: 6 Seconds Memory Limit: 131072 KBDreamGrid has an array of integers. On this array he can perform the following operation: choose an element that was not previously chosen...原创 2018-09-17 22:36:00 · 569 阅读 · 0 评论 -
计蒜客 Ryuji doesn't want to study(2018 ICPC亚洲区域赛网络赛 徐州 H)(线段树)
Ryuji is not a good student, and he doesn't want to study. But there are n books he should learn, each book has its knowledge a[i]a[i].Unfortunately, the longer he learns, the fewer he gets.That m...原创 2018-09-10 21:12:21 · 197 阅读 · 0 评论 -
计蒜客 Trace(2018 ICPC亚洲区域赛网络赛 徐州 G)(线段树)
There's a beach in the first quadrant. And from time to time, there are sea waves. A wave ( xx , yy ) means the wave is a rectangle whose vertexes are ( 00 , 00 ), ( xx , 00 ), ( 00 , yy ), ( xx , yy ...原创 2018-09-11 10:44:41 · 301 阅读 · 0 评论 -
牛客国庆集训派对Day6 I-清明梦超能力者黄YY (树链剖分+区间最值+区间染色)
链接:https://www.nowcoder.com/acm/contest/206/I来源:牛客网 题目描述黄YY是一个清明梦超能力者,同时也是一个记忆大师。他能够轻松控制自己在梦中的一切,在醒来之后还能清晰的记得梦中所有的细节,这让他的朋友们都十分羡慕。又是一个晚上,黄YY又到了自己的梦中,并且随手造出了一棵有n个点的树,树上每个点有一个初始颜色0。为了让这棵树不那么单调,黄Y...原创 2018-10-06 19:46:57 · 369 阅读 · 0 评论 -
Gym - 101889I Imperial roads (树链剖分维护边权最大值)
题意:给你一个图,然后Q个询问,每个询问,问强制要求使用某条边的情况下的最小生成树。 解题思路:先求最小生成树,然后对于强制要求的边,直接查询树上路径最大值,然后减去这个最大值,再加上要求的边的权值就是答案。 直接上树链剖分即可。 #include<bits/stdc++.h>using namespace std;const int MA...原创 2018-10-13 21:41:35 · 579 阅读 · 0 评论 -
CodeForces - 981E Addition on Segments(线段树+bitset优化01背包)
E. Addition on Segmentstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGrisha come to a contest and faced the following problem....原创 2018-10-07 21:51:33 · 316 阅读 · 0 评论 -
CodeForces - 981G Magic multisets(线段树+set维护区间信息)
G. Magic multisetstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the School of Magic in Dirtpolis a lot of interesting objec...原创 2018-10-08 17:10:06 · 387 阅读 · 0 评论 -
Gym - 101908H Police Hypothesis (字符串哈希 + 树链剖分 + 区间合并)
H. Police Hypothesistime limit per test8.0 smemory limit per test1024 MBinputstandard inputoutputstandard outputThe public transport system of Nlogônia has an express network connect...原创 2018-10-19 16:30:18 · 343 阅读 · 0 评论 -
CodeForces - 1070C Cloud Computing(线段树二分)
C. Cloud Computingtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBuber is a Berland technology company that specializes in wast...原创 2018-10-21 12:51:26 · 1019 阅读 · 0 评论 -
CodeForces - 1000F One Occurrence(莫队+分块 | 线段树 | 主席树)
F. One Occurrencetime limit per test3 secondsmemory limit per test768 megabytesinputstandard inputoutputstandard outputYou are given an array aa consisting of nn integers, and qq que...原创 2018-10-23 17:44:27 · 478 阅读 · 0 评论 -
CodeForces - 1004F Sonya and Bitwise OR(线段树区间合并)
F. Sonya and Bitwise ORtime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputSonya has an array a1,a2,…,ana1,a2,…,an consisting of nn ...原创 2018-10-24 17:15:30 · 498 阅读 · 0 评论 -
Gym - 101630G The Great Wall (二分+线段树) (2017–2018, NEERC – Northern Eurasia Finals)
解题思路:首先求第k小的答案,通常套路都是二分答案,然后判断有多少个答案比他小即可。关键在于如何高效的判断有多少个答案比他小,如果我们把所有答案预处理出来,复杂度是N^2级别的,但是我们不必把所有答案都预处理出来,我们只需要知道有多少个比他小即可。因此我们可以通过各种数据结构,高效的查询有多少个比他小即可。这样复杂度就可以去到NLogN了。这里需要巧妙地转化,使得可以在O(NlogN...原创 2018-11-13 15:48:33 · 370 阅读 · 0 评论 -
Gym - 101194G Pandaria (并查集+倍增+线段树合并)
题意:给定一个无向图。每个点有一种颜色。现在给定q个询问,每次询问x和w,求所有能通过边权值不超过w的边走到x的点的集合中,哪一种颜色的点出现的次数最多。次数相同时输出编号最小的那个颜色。强制在线。 解题思路:膜拜大神们的代码!看了好久,终于搞懂了。 我们假设有一个二维数组存储了所有答案ans[x][w],那么对于每次查询,我们直接输出答案即可。关键在于怎么快速计算这...原创 2018-11-15 15:32:03 · 596 阅读 · 0 评论 -
ZOJ - 4068 Airdrop (思维)(The 2018 ACM-ICPC Asia Qingdao Regional Contest - K)
AirdropTime Limit: 2 Seconds Memory Limit: 65536 KBPUBG is a multiplayer online battle royale video game. In the game, up to one hundred players parachute onto an island and scavenge for weap...原创 2018-11-14 18:16:47 · 729 阅读 · 0 评论 -
HDU - 6392 Reverse Game (2018 Multi-University Training Contest 7)(线段树 + 并查集)
Reverse GameTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 112 Accepted Submission(s): 52 Problem DescriptionOne day, Umaru was enj...原创 2018-09-12 17:25:59 · 260 阅读 · 0 评论 -
BZOJ - 1453 Dface双面棋盘 (并查集+线段树)
1453: [Wc]Dface双面棋盘Time Limit: 10 Sec Memory Limit: 64 MBSubmit: 847 Solved: 453[Submit][Status][Discuss]DescriptionInputOutputSample InputSample OutputHINT Source...原创 2018-09-12 17:02:32 · 356 阅读 · 0 评论 -
hihoCoder - 1586 Minimum (2017 ACM-ICPC 亚洲区 (北京赛区) 网络赛 I)
ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 I#1586 : Minimum时间限制:1000ms单点时限:1000ms内存限制:256MB描述You are given a list of integers a0, a1, …, a2^k-1.You need to support原创 2017-09-23 18:55:20 · 1451 阅读 · 0 评论 -
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 17:38:13 · 516 阅读 · 0 评论 -
HYSBZ - 2243 染色(树链剖分 线段树 区间染色)
染色Description给定一棵有n个节点的无根树和m个操作,操作有2类:1、将节点a到节点b路径上所有点都染成颜色c;2、询问节点a到节点b路径上的颜色段数量(连续相同颜色被认为是同一段),如“112221”由3段组成:“11”、“222”和“1”。请你写一个程序依次完成这m个操作。Input第一行包含2个整数n和m,分别表示节点数和操作数;原创 2017-10-17 16:50:00 · 286 阅读 · 0 评论 -
GYM - 101201J Shopping(线段树求不比C大的第一个数)
The sale bin of Big Box Bargains contains n products in a row. The ith item has price ai per unit.There is no limit to the quantity of any item.There are q customers who will enter the store to buy it原创 2017-10-02 20:38:01 · 426 阅读 · 0 评论 -
POJ - 3237 Tree (树链剖分+线段树+区间修改)
TreeDescriptionYou are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 through N − 1. Each edge is associated with a weight. Then you are to e原创 2017-10-17 15:06:08 · 452 阅读 · 0 评论 -
BZOJ - 4568 幸运数字 (树链剖分+线段树+线性基)
4568: [Scoi2016]幸运数字DescriptionA 国共有 n 座城市,这些城市由 n-1 条道路相连,使得任意两座城市可以互达,且路径唯一。每座城市都有一个幸运数字,以纪念碑的形式矗立在这座城市的正中心,作为城市的象征。一些旅行者希望游览 A 国。旅行者计划乘飞机降落在 x 号城市,沿着 x 号城市到 y 号城市之间那条唯一的路径游览,最终从 y 城市起飞离开 A 国。在经过每一座...原创 2017-11-02 18:17:01 · 396 阅读 · 0 评论 -
HDU - 4117 GRE Words (AC自动机+Fail树+线段树+DFS序+DP)
GRE WordsProblem DescriptionRecently George is preparing for the Graduate Record Examinations (GRE for short). Obviously the most important thing is reciting the words.Now George is workin原创 2017-11-20 21:21:41 · 3254 阅读 · 2 评论 -
GYM - 100812E World of Knights (线段树+二分)
World of Knightstime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputI woke up tied to an iron chair in a wet basement lig原创 2017-11-30 23:56:48 · 357 阅读 · 0 评论 -
GYM - 100812F Graveyard of Bandits (线段树)
Graveyard of Banditstime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputThe rain still didn't want to stop, as well as my原创 2017-12-01 22:06:54 · 274 阅读 · 0 评论 -
HDU - 3333 Turing Tree (线段树+离线查询)
Turing TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6122 Accepted Submission(s): 2189Problem DescriptionAfter inventing Turing Tree, 3...原创 2018-03-08 14:21:52 · 267 阅读 · 0 评论 -
HDU - 5458 Stability (边双连通分量+树链剖分+线段树)
StabilityTime Limit: 3000/2000 MS (Java/Others) Memory Limit: 65535/102400 K (Java/Others)Total Submission(s): 2007 Accepted Submission(s): 470Problem DescriptionGiven an undirected connected gr...原创 2018-05-24 20:44:37 · 243 阅读 · 0 评论 -
HDU - 6393 Traffic Network in Numazu (线段树+LCA)(2018 Multi-University Training Contest 7 1008)
Traffic Network in NumazuTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3 Accepted Submission(s): 1 Problem DescriptionChika is el...原创 2018-08-13 17:29:00 · 348 阅读 · 0 评论 -
计蒜客 Lpl and Energy-saving Lamps (2018 ICPC亚洲区域赛网络赛 南京 G)(线段树区间查询第一个小于等于K的数)
During tea-drinking, princess, amongst other things, asked why has such a good-natured and cute Dragon imprisoned Lpl in the Castle? Dragon smiled enigmatically and answered that it is a big secret. A...原创 2018-09-03 00:06:23 · 302 阅读 · 1 评论 -
计蒜客 Jiu Yuan Wants to Eat(ACM-ICPC 2018 焦作赛区网络预赛 E)(线段树+树链剖分)
You ye Jiu yuan is the daughter of the Great GOD Emancipator. And when she becomes an adult, she will be queen of Tusikur, so she wanted to travel the world while she was still young. In a country, sh...原创 2018-09-15 22:18:22 · 373 阅读 · 0 评论 -
HDU - 6464 免费送气球(线段树二分)(“字节跳动-文远知行杯”广东工业大学第十四届程序设计竞赛)
免费送气球Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 105Accepted Submission(s): 15Problem Description又到了GDUT一年一度的程序设计竞赛校赛的时间啦。同学们只要...原创 2019-03-16 20:29:22 · 1325 阅读 · 1 评论