线段树
lyyy.
这里介绍不了我
展开
-
hdu1754 I Hate It (分数修改)-线段树
线段树原创 2016-04-12 16:26:32 · 529 阅读 · 0 评论 -
poj 1436 Horizontally Visible Segments - 线段树区间更新
poj 1436 Horizontally Visible Segments - 线段树区间更新There is a number of disjoint vertical line segments in the plane. We say that two segments are horizontally visible if they can be connected by a horizontal line segment that does not have any common points原创 2017-10-02 19:58:21 · 388 阅读 · 0 评论 -
poj 3225 Help with Intervals -线段树-延迟标记-区间交并补
poj 3225 Help with Intervals -线段树-延迟标记-区间交并补LogLoader, Inc. is a company specialized in providing products for analyzing logs. While Ikki is working on graduation design, he is also engaged in an internship at LogLoader. Among his tasks, one is to write a原创 2017-10-02 11:48:41 · 582 阅读 · 0 评论 -
hdu 4027 Can you answer these queries?-特殊的单节点更新
hdu 4027 Can you answer these queries?-特殊的单节点更新A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be marked a value of endurance. F原创 2017-10-01 21:39:07 · 277 阅读 · 0 评论 -
hdu1698-Just a Hook-线段树-整段区间的替换(延迟标记)
hdu1689-Just a Hook-线段树-整段区间的替换(延迟标记)In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.原创 2016-08-11 14:27:29 · 881 阅读 · 0 评论 -
hdu 5239 Doom - 线段树 +特殊取模
hdu 5239 Doom - 线段树 +特殊取模THE END IS COMINGGGGGG!Mike has got stuck on a mystery machine. If he cannot solve this problem, he will go to his doom.This machine is consist of ncells, and a screen. The i-th cell contains a number ai(1≤i≤n). The screen also con原创 2017-05-05 16:36:24 · 441 阅读 · 0 评论 -
poj 2828 Buy Tickets -插队问题-单节点更新-线段树
Buy TicketsRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year was approaching, but unluckily the Little Cat still had schedules going here and there. Now, he had to t原创 2016-11-11 19:07:09 · 587 阅读 · 0 评论 -
poj 3667 hotel - 线段树-区间更新-延迟标记
poj 3667 hotel - 线段树-区间更新-延迟标记The cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ever the competent travel agent, has named the Bullmoose Hotel on famed Cumb原创 2017-04-15 20:19:21 · 359 阅读 · 0 评论 -
hdu 2795 Billboard - 线段树 -区间最大值
hdu 2795 BillboardAt the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements are posted: nearest programming competitions, changes in th原创 2017-04-15 14:29:40 · 313 阅读 · 0 评论 -
hdu 1394 Minimum Inversion Number -求逆序对的个数- 线段树单节点更新
hdu 1394 Minimum Inversion NumberThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.For a given sequence of numbers a1, a2, ..., an, if we move the first m >= 0 numbers to the en原创 2017-04-13 18:55:29 · 287 阅读 · 0 评论 -
POJ 2528 Mayor's posters - 线段树区间更新+离散化
POJ 2528 Mayor's postersThe 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 decided to build an electoral wal原创 2017-04-13 17:49:44 · 487 阅读 · 0 评论 -
hdu 5875 Function -线段树+取余 -ICPC网络赛大连赛区
FunctionThe shorter, the simpler. With this problem, you should be convinced of this truth. You are given an array A of N postive integers, and M queries in the form (l,r). A function F(l,r) (1≤l≤r≤N) is defined as:F(l,r)={AlF(l,r−1) modArl=r;l<r.You原创 2016-09-19 20:44:54 · 495 阅读 · 0 评论 -
poj-3468 A Simple Problem with Integers-线段树-整段区间增加求和
题目地址:http://poj.org/problem?id=3468A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072K Case Time Limit: 2000MSDescriptionYou hav原创 2016-08-11 17:48:23 · 457 阅读 · 0 评论 -
hdu1166 敌兵布-线段树的简单应用-查询更改
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1166思路:线段树的简单更新查找应用代码:#include#includeusing namespace std;#define maxn 50000struct mtree{ int b,e;//b-e为区间 int sum;}tree[ma原创 2016-04-21 10:37:24 · 317 阅读 · 0 评论 -
L3-002. 堆栈 -STL + 线段树单节点更新
L3-002. 堆栈时间限制 200 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 陈越大家都知道“堆栈”是一种“先进后出”的线性结构,基本操作有“入栈”(将新元素插入栈顶)和“出栈”(将栈顶元素的值返回并从堆栈中将其删除)。现请你实现一种特殊原创 2018-03-20 20:24:19 · 291 阅读 · 0 评论