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 阅读(833) 评论(0) 推荐(0) 编辑
