随笔分类 -  划分树

HDU 4417 Super Mario(划分树)
摘要:Super MarioTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1437Accepted Submission(s): 690Problem DescriptionMario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble a 阅读全文

posted @ 2013-07-30 09:52 kuangbin 阅读(999) 评论(0) 推荐(0)

HDU 3473 Minimum Sum(划分树)
摘要:Minimum SumTime Limit: 16000/8000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2235Accepted Submission(s): 512Problem DescriptionYou are given N positive integers, denoted as x0, x1 ... xN-1. Then give you some intervals [l, r]. For each interval, you need to find a 阅读全文

posted @ 2013-07-30 09:51 kuangbin 阅读(859) 评论(0) 推荐(0)

HDU 4417 Super Mario 第37届ACM/ICPC 杭州赛区网络赛第1008题 (划分树)
摘要:Super MarioTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 120Accepted Submission(s): 73Problem DescriptionMario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble aga 阅读全文

posted @ 2012-09-23 20:44 kuangbin 阅读(1448) 评论(3) 推荐(0)

HDU 3473 Minimum Sum(划分树,求中位数,小于中位数的和与大于中位数的和)
摘要:Minimum SumTime Limit: 16000/8000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1533Accepted Submission(s): 345Problem DescriptionYou are given N positive integers, denoted as x0, x1 ... xN-1. Then give you some intervals [l, r]. For each interval, you need to find a 阅读全文

posted @ 2012-08-16 01:48 kuangbin 阅读(845) 评论(0) 推荐(0)

HDU 4251 The Famous ICPC Team Again(划分树入门题)
摘要:The Famous ICPC Team AgainTime Limit: 30000/15000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 438Accepted Submission(s): 193Problem DescriptionWhen Mr. B, Mr. G and Mr. M were preparing for the 2012 ACM-ICPC World Final Contest, Mr. B had collected a large set of co 阅读全文

posted @ 2012-08-14 23:12 kuangbin 阅读(730) 评论(0) 推荐(0)

HDU 2665 Kth number(划分树入门题,纯套模板)
摘要:Kth numberTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2026Accepted Submission(s): 672Problem DescriptionGive you a sequence and ask you the kth big number of a inteval.InputThe first line is the number of the test cases. For each test case, th 阅读全文

posted @ 2012-08-14 21:01 kuangbin 阅读(1946) 评论(0) 推荐(0)

导航

JAVASCRIPT: