线段树
文章平均质量分 84
还是太年轻
这个作者很懒,什么都没留下…
展开
-
HDU 1542 Atlantis(线段树+扫描线求面积并)
题目链接题意:给出n个矩形的左下坐标和右上坐标(矩形有重叠)求面积。题解:这是一道用扫描线求面积并的题目。学习见:扫描线法求矩形面积并和扫描线专辑#include<bits/stdc++.h>using namespace std;const int maxn=107;double y[maxn*2];struct LINE{ double x,y_down,y_up...原创 2018-02-28 11:52:51 · 153 阅读 · 0 评论 -
Wannafly挑战赛13 E-VVQ与线段 (ST+RMQ)
链接:https://www.nowcoder.com/acm/contest/80/E来源:牛客网题目描述 VVQ 最近迷上了线段这种东西 现在他手上有 n 条线段,他希望在其中找到两条有公共点的线段,使得他们的异或值最大。 定义线段的异或值为它们并的长度减他们交的长度 输入描述:第一行包括一个正整数 n,表示 VVQ 拥有的线段条数。接下来 n 行每行包括两个正整数 l,...原创 2018-04-08 16:11:55 · 289 阅读 · 0 评论 -
POJ 1769 Minimizing maximizer(dp+线段树)
Minimizing maximizerTime Limit: 5000MS Memory Limit: 30000KTotal Submissions: 4669 Accepted: 1909DescriptionThe company Chris Ltd. is preparing a new sorting hardware called Maximizer. Maximizer has n...原创 2018-03-29 11:13:52 · 367 阅读 · 0 评论 -
Codeforce 101B. Buses(线段树or树状数组+离散化)
B. Busestime limit per test2 secondsmemory limit per test265 megabytesinputstandard inputoutputstandard outputLittle boy Gerald studies at school which is quite far from his house. That's why he has t...原创 2018-04-12 20:36:20 · 427 阅读 · 0 评论 -
2018年东北农业大学春季校赛 L-why的天鹅(离线线段树+离散化)
链接:https://www.nowcoder.com/acm/contest/93/L来源:牛客网题目描述 你们wyh学长小时候住在河边,因为周围的生态环境非常好,所以经常会有天鹅浮在湖面上,每只天鹅都长得不一样,它们偶尔排成一排,偶尔分散开,偶尔也会去其他河畔,wyh学长为了统计它们的个数,编了一个程序赋予它们一个“萌”值,但是这些天鹅很不听话,一会儿会从别的地方游过来一两只,一会儿又会在统...原创 2018-04-07 13:12:50 · 275 阅读 · 0 评论 -
2018年东北农业大学春季校赛 L-why的天鹅(动态线段树)
链接:https://www.nowcoder.com/acm/contest/93/L来源:牛客网题目描述 你们wyh学长小时候住在河边,因为周围的生态环境非常好,所以经常会有天鹅浮在湖面上,每只天鹅都长得不一样,它们偶尔排成一排,偶尔分散开,偶尔也会去其他河畔,wyh学长为了统计它们的个数,编了一个程序赋予它们一个“萌”值,但是这些天鹅很不听话,一会儿会从别的地方游过来一两只,一会儿又会在统...原创 2018-04-07 13:21:00 · 308 阅读 · 0 评论 -
Wannafly挑战赛15 D-数字串(线段树)
链接:https://www.nowcoder.com/acm/contest/112/D来源:牛客网题目描述 一个只含数字的字符串,q次操作,每次操作将第i位数字改为x,每次操作后,统计长度在[l, r]之间且首数字大于尾数字的子串的个数。 输入描述:第一行一个只含数字的字符串;第二行3个整数q, l, r;接下来q行,每行两个整数i, x。输出描述:输出q行,每行一个整数,表示长度在[l...原创 2018-05-12 12:27:14 · 226 阅读 · 0 评论 -
zufe 2485 Sequence
问题 W: Sequence时间限制: 2 Sec 内存限制: 128 MB提交: 4 解决: 3[提交][状态][讨论版]题目描述有一个序列,n个非负整数,a1,a2,a3,a4......,an有Q次操作,操作分两种:1 p x:将a[p]改为x2 L R:查询区间[L,R]中 大于等于pow(17,last%5) 的数字有几个,last是上一次询问的答案,一开始设last为0。输入第一行...原创 2018-05-19 21:06:25 · 120 阅读 · 0 评论 -
2015 ACM Amman Collegiate Programming Contest L. Alternating Strings II(dp+线段树)
#include<bits/stdc++.h>using namespace std;char t[100003];int dp[100003];struct node{ int left,right,mid; int x;}tree[400004];void build(int l,int r,int rt){ tree[rt].left=l;...原创 2018-06-01 22:42:54 · 179 阅读 · 0 评论 -
CodeForce 981 E 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.You are given an a...原创 2018-06-16 19:33:14 · 311 阅读 · 0 评论 -
CodeForce 994 B. Knights of a Polygonal Table(线段树)
B. Knights of a Polygonal Tabletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputUnlike Knights of a Round Table, Knights of a Polygonal Table depriv...原创 2018-06-17 14:37:53 · 280 阅读 · 0 评论 -
hdu 5475 An easy problem(线段树)
An easy problemTime Limit: 8000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2826 Accepted Submission(s): 1056Problem DescriptionOne day, a useless calcula...原创 2018-07-08 23:50:26 · 141 阅读 · 0 评论 -
2018年全国多校算法寒假训练营练习比赛(第五场)G-Tree Recovery
链接:https://www.nowcoder.com/acm/contest/77/H来源:牛客网题目描述 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 ...原创 2018-02-26 09:15:44 · 286 阅读 · 0 评论 -
2018年全国多校算法寒假训练营练习比赛(第五场)B(简单线段树)
链接:https://www.nowcoder.com/acm/contest/77/B来源:牛客网题目描述 给一个数列,会有多次询问,对于每一次询问,会有两种操作: 1:给定两个整数x, y, 然后在原数组的第x位置上加y; 2:给定两个整数l,r,然后输出数组从第l位加到第r位数字的和并换行 输入描述:第一行有两个整数n, m(1 <= n, m <= 1000...原创 2018-02-26 08:58:25 · 305 阅读 · 0 评论 -
POJ 2104 K-th Number(线段树+二分)
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions:63368 Accepted: 22321Case Time Limit: 2000MSDescriptionYou are working for Macrohard company in data structures department. After f...原创 2018-02-25 11:36:46 · 291 阅读 · 0 评论 -
HDU 1166 敌兵布阵(简单RMQ)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 107075 Accepted Submission(s): 45007Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek...原创 2018-02-19 10:19:07 · 126 阅读 · 0 评论 -
HDU 1828 Picture(线段树+扫描线求周长并)
PictureTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5768 Accepted Submission(s): 2740Problem DescriptionA number of rectangular posters, p...原创 2018-02-28 16:44:23 · 299 阅读 · 0 评论 -
HDU 1394 Minimum Inversion Number
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22542 Accepted Submission(s): 13419Problem DescriptionThe inversion n...原创 2018-02-20 16:21:37 · 135 阅读 · 0 评论 -
HDU 2795 Billboard
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25686 Accepted Submission(s): 10523Problem DescriptionAt the entrance to the univer...原创 2018-02-20 17:47:00 · 136 阅读 · 0 评论 -
HDU 1698 Just a Hook(区间修改线段树)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 37534 Accepted Submission(s): 18297Problem DescriptionIn the game of DotA, Pudge’s...原创 2018-02-20 18:57:59 · 163 阅读 · 0 评论 -
HDU 3308 LCIS(线段树区间合并)
LCISTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8187 Accepted Submission(s): 3512Problem DescriptionGiven n integers.You have two operati...原创 2018-02-22 10:53:16 · 205 阅读 · 0 评论 -
HDU 3265 Posters
PostersTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6675 Accepted Submission(s): 1610Problem DescriptionTed has a new house with a huge wi...原创 2018-03-01 16:51:23 · 120 阅读 · 0 评论 -
HDU 3642 Get The Treasury
Get The TreasuryTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3023 Accepted Submission(s): 979Problem DescriptionJack knows that there is ...原创 2018-03-01 21:36:16 · 169 阅读 · 0 评论 -
HDU 3255 Farming
FarmingTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1929 Accepted Submission(s): 599Problem DescriptionYou have a big farm, and you want ...原创 2018-03-02 10:24:15 · 170 阅读 · 0 评论 -
HDU 3397 Sequence operation(线段树区间合并+区间修改)
Sequence operationTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8568 Accepted Submission(s): 2593Problem Descriptionlxhgww got a sequence ...原创 2018-02-23 15:33:56 · 275 阅读 · 0 评论 -
HDU 1540 Tunnel Warfare
Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10790 Accepted Submission(s): 4235Problem DescriptionDuring the War of Resistan...原创 2018-02-24 16:45:24 · 137 阅读 · 0 评论 -
HDU 6315 Naive Operations(线段树)
Naive OperationsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 502768/502768 K (Java/Others)Total Submission(s): 1244 Accepted Submission(s): 519 Problem DescriptionIn a galaxy far...原创 2018-07-26 10:59:13 · 299 阅读 · 0 评论