HDU 2665 Kth number 可持久化线段树
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 integer n and m (n, m <= 1000
原创
2017-10-22 22:47:58 ·
232 阅读 ·
0 评论