线段树
绝尘花遗落
一骑红尘妃子笑,无人知是荔枝来
展开
-
Prime Query (ZOJ 3911 线段树)
Prime Query Time Limit: 1 Second Memory Limit: 196608 KBYou are given a simple task. Given a sequence A[i] with N numbers. You have to perform Q operations on the given sequence.Here are the oper原创 2015-10-13 19:11:04 · 652 阅读 · 0 评论 -
K-th Number【POJ2104】——主席树
Time Limit: 20000MS Memory Limit: 65536KCase Time Limit: 2000MSDescriptionYou are working for Macrohard company in data structures department. After failing your previous task about key insertion y原创 2016-05-05 21:28:22 · 661 阅读 · 0 评论 -
codeforces 370 Div2
Codeforces 370 Div2A Memory and CrowB Memory and Trident C Memory and De-EvolutionE Memory and Casinos原创 2016-09-13 19:09:27 · 1018 阅读 · 0 评论 -
2016 Mulit-University Training Contest 8
HDU【5821】——Rikka with SequenceHDU【5826】——physicsHDU【5828】——Rikka with SequenceHDU【5831】——Rikka with Parenthesis II原创 2016-08-11 20:19:52 · 956 阅读 · 0 评论 -
【UVA11992】Fast Matrix Operations——二维线段树
UVA11992给你 一个矩阵和一些的操作,计算子矩阵的和,最大值,最小值。1表示矩阵所有的元素加v,2表示矩阵所有的元素变为v,3表示查询区间的信息。由于最大只有20行,所以对于每一行建立一颗线段树。进行区间操作,比较恶心的是区间加和区间更改的关系。原创 2016-10-12 23:56:13 · 411 阅读 · 0 评论 -
【HDU5919】Sequence II——主席树+二分
HUD5919 Sequence IITime Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionMr. Frog has an integer sequence of length n,原创 2016-10-13 13:24:38 · 767 阅读 · 0 评论 -
POJ【4047】——Problem D. Garden 线段树
DescriptionThere are n flowerpots in Daniel’s garden. These flowerpots are place positions, and these n positions are numbered from 1 to n. Each flower is assigned an aesthetic value. The aesthetic val原创 2016-09-29 20:22:04 · 413 阅读 · 0 评论 -
【codefores 587 E】Duff as a Queen——线段树+线性基
time limit per test7 seconds memory limit per test256 megabytesDuff is the queen of her country, Andarz Gu. She’s a competitive programming fan. That’s why, when he saw her minister, Malek, free, she原创 2016-11-11 22:49:26 · 1619 阅读 · 1 评论 -
【Bzoj4184】 shallot——时间分治+线性基
Time Limit: 30 Sec Memory Limit: 128 MBDescription小苗去市场上买了一捆小葱苗,她突然一时兴起,于是她在每颗小葱苗上写上一个数字,然后把小葱叫过来玩游戏。每个时刻她会给小葱一颗小葱苗或者是从小葱手里拿走一颗小葱苗,并且 让小葱从自己手中的小葱苗里选出一些小葱苗使得选出的小葱苗上的数字的异或和最大。 这种小问题对于小葱来说当然不在话下,但是他的身原创 2016-11-23 13:07:53 · 867 阅读 · 0 评论 -
101Hack44
Hackerrank101hack44Picking NumbersAlice and Bob's Silly GameExpected Tree LeavesPalindromic Subsets原创 2016-12-15 12:06:59 · 515 阅读 · 0 评论 -
敌兵布阵(线段树HDU 1166)
敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 59947 Accepted Submission(s): 25363Problem Description C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子D原创 2015-08-18 21:45:40 · 343 阅读 · 0 评论 -
A Simple Problem with Integers
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 77964 Accepted: 24012 Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, … , AN. Yo原创 2015-08-17 07:45:33 · 415 阅读 · 0 评论 -
Minimum Inversion Number
Minimum Inversion Number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14585 Accepted Submission(s): 8901Problem Description The inversi原创 2015-08-16 19:51:11 · 423 阅读 · 0 评论 -
Boring Counting——【SDUT2610】主席树
Boring Counting Time Limit: 3000ms Memory limit: 65536K 题目描述 In this problem you are given a number sequence P consisting of N integer and Pi is the ith element in the sequence. Now you task is to原创 2016-05-04 18:52:07 · 659 阅读 · 0 评论 -
【POJ1765】November Rain——扫描线+线段树
November Rain Time Limit: 5000MS Memory Limit: 65536KCase Time Limit: 2000MSDescriptionContemporary buildings can have very complicated roofs. If we take a vertical section of such a roof it result原创 2016-04-02 16:59:45 · 814 阅读 · 1 评论 -
R2D2 and Droid Army(多棵线段树)
R2D2 and Droid Army time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputAn army of n droids is lined up in one row. Each droid is descri原创 2015-08-23 16:30:00 · 759 阅读 · 0 评论 -
Wow! Such Sequence!(线段树4893)
Wow! Such Sequence! Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3808 Accepted Submission(s): 1079Problem Description Recently, Doge g原创 2015-08-30 18:52:51 · 473 阅读 · 0 评论 -
Stars(树状数组或线段树)
Stars Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 37323 Accepted: 16278Description Astronomers often examine star maps where stars are represented by points on a plane and原创 2015-08-14 16:15:44 · 1129 阅读 · 0 评论 -
覆盖的面积(HDU 1255 线段树)
覆盖的面积Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input输入数据的第一行是一个正整数T(1注意:本题的输入原创 2015-10-13 20:49:43 · 658 阅读 · 0 评论 -
SUDTOJ 3323园艺问题 (线段树)
园艺问题 Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述本巨养了一盆双色茉莉。这种花有一种特点:第i朵花在第Di天盛开,刚开时是紫色的,Ai天之后会变成白色,再过Bi天就会凋谢。如Di = 3,Ai = 4,Bi = 5,那么在第3至6天为紫色,第7至11天为白色,第11天之后就凋谢了。现在给出一些事件,你需要按要求给出答案。原创 2015-09-15 19:50:35 · 760 阅读 · 0 评论 -
Lost Cows(线段树 POJ2182)
Lost Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10354 Accepted: 6631Description N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular displ原创 2015-09-06 15:07:48 · 625 阅读 · 0 评论 -
Count Color(线段树+位运算 POJ2777)
Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 39917 Accepted: 12037Description Chosen Problem Solving and Program design as an optional course, you are required原创 2015-09-04 20:28:00 · 551 阅读 · 0 评论 -
Mayor's posters(线段树+离散化POJ2528)
Mayor’s posters Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 51175 Accepted: 14820Description The citizens of Bytetown, AB, could not stand that the candidates in the mayor原创 2015-09-04 16:44:19 · 462 阅读 · 0 评论 -
【POJ2886】Who Gets the Most Candies?-线段树+反素数
Time Limit: 5000MS Memory Limit: 131072K Case Time Limit: 2000MSDescriptionN children are sitting in a circle to play a game. The children are numbered from 1 to N in clockwise order. Each of th原创 2016-03-05 16:55:16 · 424 阅读 · 0 评论 -
【POJ2750】Potted Flower——线段树
Time Limit: 2000MS Memory Limit: 65536K DescriptionThe little cat takes over the management of a new park. There is a large circular statue in the center of the park, surrounded by N pots of flow原创 2016-03-17 18:19:49 · 396 阅读 · 0 评论 -
FZU 2105 Digits Count(线段树)
Problem 2105 Digits Count Accept: 302 Submit: 1477 Time Limit: 10000 mSec Memory Limit : 262144 KB Problem DescriptionGiven N integers A={A[0],A[1],…,A[N-1]}. Here we have some operations:Oper原创 2015-08-23 20:56:26 · 509 阅读 · 0 评论 -
【SPOJ375】 Query on a tree——树链剖分
You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3…N-1.We will ask you to perfrom some instructions of the following form:CHANGE i ti : change the cos原创 2016-03-20 19:49:56 · 448 阅读 · 0 评论 -
I Hate It
I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 51440 Accepted Submission(s): 20163Problem Description 很多学校流行一种比较的习惯。老师们很喜欢询问,从某原创 2015-08-16 19:24:06 · 345 阅读 · 0 评论