划分树
XTU_wcb
这个作者很懒,什么都没留下…
展开
-
hdu 2665 Kth number
Problem Description Give you a sequence and ask you the kth big number of a inteval. Input The first line is the number of the test cases. For each test case, the first line contain two inte原创 2015-07-29 18:04:57 · 294 阅读 · 0 评论 -
hdu 3473 Minimum Sum
Problem Description You 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!原创 2015-07-29 18:17:03 · 446 阅读 · 0 评论