线段树
文章平均质量分 86
glu_cky
未来再远,远不过我一路向前的步伐。
展开
-
Buy Tickets(线段树)
http://poj.org/problem?id=2828模板题,从后面往前扫,维护空格数目Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 17482 Accepted: 8678DescriptionRailw原创 2016-04-06 10:32:43 · 254 阅读 · 0 评论 -
Can you answer these queries?
区间建树,维护区间和Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 11858 Accepted Submission(s): 2801Pr原创 2016-04-21 19:22:39 · 229 阅读 · 0 评论 -
Balanced Lineup
对区间建树,维护区间最大值最小值。Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 43493 Accepted: 20419Case Time Limit: 2000MSDescriptionFor原创 2016-04-21 19:01:04 · 222 阅读 · 0 评论 -
Count the Colors
线段树,对区间建树,维护区间颜色Count the ColorsTime Limit: 2 Seconds Memory Limit: 65536 KBPainting some colored segments on a line, some previously painted segments may be covered by some the subse原创 2016-04-20 12:28:30 · 241 阅读 · 0 评论 -
Problem 2236 第十四个目标
http://acm.fzu.edu.cn/problem.php?pid=2236 Problem 2236 第十四个目标Accept: 2 Submit: 3Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description目暮警官、妃英里、阿笠博士等人接连遭到不明身份之人的原创 2016-05-03 09:22:31 · 475 阅读 · 0 评论 -
Mayor's posters
区间更新,区间求和,提供一个区间离散化技术http://poj.org/problem?id=2528Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 55184 Accepted: 16008Description原创 2016-04-08 17:17:08 · 326 阅读 · 0 评论 -
A Simple Problem with Integers
区间更新,区间求和http://poj.org/problem?id=3468A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 87351 Accepted: 27114Case Time L原创 2016-04-08 13:56:26 · 274 阅读 · 0 评论 -
Just a Hook
区间更新,区间求和,对线段建树,维护区间和http://acm.hdu.edu.cn/showproblem.php?pid=1698Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2560原创 2016-04-08 13:37:22 · 274 阅读 · 0 评论 -
Billboard
将h分割对其建树,树的大小siz=min(h,n)维护区间剩余最长的长度http://acm.hdu.edu.cn/showproblem.php?pid=2795BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submi原创 2016-04-06 18:49:18 · 271 阅读 · 0 评论 -
Minimum Inversion Number
逆序数个数,找最小的逆序数对数,对所输入的数字建树,维护区间输入数字的个数http://acm.hdu.edu.cn/showproblem.php?pid=1394Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Other原创 2016-04-06 18:30:49 · 327 阅读 · 0 评论 -
I Hate It
http://acm.hdu.edu.cn/showproblem.php?pid=1754单点更新求区间最大值I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 58715 Accepted S原创 2016-04-06 18:13:23 · 295 阅读 · 0 评论 -
敌兵布阵
http://acm.hdu.edu.cn/showproblem.php?pid=1166单点更新,区间求和敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 68897 Accepted Submiss原创 2016-04-06 11:06:24 · 612 阅读 · 0 评论 -
Assign the task(dfs+线段树_
http://acm.hdu.edu.cn/showproblem.php?pid=3974),亚信科技,壹晨仟阳(杭州) Assign the taskTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Sub原创 2016-05-23 10:39:14 · 586 阅读 · 0 评论