![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
划分树
文章平均质量分 86
Lionel_D
这个作者很懒,什么都没留下…
展开
-
hud 2665 Kth number 划分树 这道题真坑!!明明求的是区间第K小数。。。
Problem 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, the first line contain two integer n and m (n, m <= 100000), indicates the number of integers原创 2015-02-02 15:02:23 · 1370 阅读 · 0 评论 -
hdu 3473 Minimum Sum 再来一波划分树,对划分树累觉不爱。
Problem 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 number x to make as small as possible! InputThe first line is an integer T (T <= 10), indicat原创 2015-02-07 13:02:22 · 923 阅读 · 0 评论