线段树
say_c_box
小白不能不努力~
展开
-
Hdu 1394——Minimum Inversion Number 线段树应用(自己的详细分析)
Minimum Inversion Number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16258 Accepted Submission(s): 9890 Problem Description原创 2016-03-31 14:44:14 · 377 阅读 · 0 评论 -
HDU 6047 Maximum Sequence (贪心,线段树)
Maximum Sequence Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 0 Accepted Submission(s): 0 Problem Description Steph is extrem原创 2017-07-27 17:36:06 · 309 阅读 · 0 评论 -
HDU4911 Inversion(线段树)
Inversion Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 4258 Accepted Submission(s): 1561 Problem Description bobo has a seq原创 2017-07-24 08:58:41 · 274 阅读 · 0 评论 -
Gym101138J ————Valentina and the Gift Tree (树链剖分,区间最大子段和,线段树)
The Valentina's birthday is coming soon! Her parents love her so much that they are preparing some gifts to give her. Valentina is cute and smart and her parents are planning to set an interesting tas原创 2017-03-01 09:29:53 · 388 阅读 · 0 评论 -
POJ2104————K-th Number(线段树,二分法)
K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 51227 Accepted: 17511 Case Time Limit: 2000MS Description You are working for Macrohard原创 2016-12-04 13:00:04 · 322 阅读 · 0 评论 -
HDU4791——Alice's Print Service(线段树)
Alice's Print Service Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2240 Accepted Submission(s): 589 Problem Description Alice原创 2016-10-15 11:00:43 · 387 阅读 · 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 : cha原创 2016-08-05 10:42:56 · 2689 阅读 · 1 评论 -
POJ3668——Frequent values(线段树,RMQ,ST表)
Frequent values Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Practice POJ 3368 Description You are given a sequence of n integers a1 ,原创 2016-07-25 22:17:55 · 759 阅读 · 0 评论 -
HDU1542——Atlantis(扫描线,线段树,矩形面积并,离散化)
I - Atlantis Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1542 Description There are several ancient Greek texts that con原创 2016-07-25 21:27:57 · 389 阅读 · 0 评论 -
POJ3221——Apple Tree(线段树,dfs序)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 25851 Accepted: 7665 Description There is an apple tree outside of kaka's house. Every autumn,原创 2016-07-25 21:20:43 · 650 阅读 · 0 评论 -
HDU5493 Queue(线段树)
Queue Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1363 Accepted Submission(s): 689 Problem Description N people numbered f原创 2017-08-29 19:22:26 · 238 阅读 · 0 评论