摘要：
http://poj.org/problem?id=2104 对权值进行建树（这个时候树的叶子是数组b的有序数列），然后二分查找原数列中每个数在有序数列中的位置（即第几小），对每一个前缀[1,i]建一棵树。用到前缀和的思想，区间第k小就可以直接查找T[r] - T[l-1]区间内第k小的数。如果对每 阅读全文
摘要：
http://acm.split.hdu.edu.cn/showproblem.php?pid=2196 Computer Computer Description A school bought the first computer some time ago(so this computer's 阅读全文
摘要：
http://acm.split.hdu.edu.cn/showproblem.php?pid=1520 Anniversary party Problem Description There is going to be a party to celebrate the 80-th Anniver 阅读全文
摘要：
http://acm.split.hdu.edu.cn/showproblem.php?pid=4035 Maze Special Judge Problem Description When wake up, lxhgww find himself in a huge maze.The maze 阅读全文
摘要：
http://acm.split.hdu.edu.cn/showproblem.php?pid=4336 Card Collector Special Judge Problem Description In your childhood, do you crazy for collecting t 阅读全文
摘要：
http://acm.split.hdu.edu.cn/showproblem.php?pid=3076 ssworld VS DDD Problem Description One day, sssworld and DDD play games together, but there are s 阅读全文
摘要：
http://acm.split.hdu.edu.cn/showproblem.php?pid=3853 LOOPS Problem Description Akemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants 阅读全文
该文被密码保护。 阅读全文
摘要：
http://acm.split.hdu.edu.cn/showproblem.php?pid=4405 Aeroplane chess Problem Description Hzz loves aeroplane chess very much. The chess map contains N 阅读全文
摘要：
1 /* 2 同余方程组 ： 3 设正整数m1.m2.mk两两互素，则方程组 4 x ≡ a1 (mod m1) 5 x ≡ a2 (mod m2) 6 x ≡ a3 (mod m3) 7 . 8 . 9 x ≡ ak (mod mk) 10 有整数解， 11 解为 x ≡ (a1 * M1 * 1/M1 + a2 * M2 * 1/M2 + a3 * M3 * 1/M3 ... 阅读全文
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=5768 Lucky7 Problem Description When ?? was born, seven crows flew in and stopped beside him. In its childho 阅读全文
摘要：
参考：http://www.cnblogs.com/frog112111/archive/2012/08/19/2646012.html 阅读全文
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=5025 Saving Tang Monk Problem Description 《Journey to the West》(also 《Monkey》) is one of the Four Great Clas 阅读全文
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1728 逃离迷宫 Problem Description 给定一个m × n (m行, n列)的迷宫，迷宫中有两个位置，gloria想从迷宫的一个位置走到另外一个位置，当然迷宫中有些地方是空地，gloria可以穿越 阅读全文
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=5795 A Simple Nim Problem Description Two players take turns picking candies from n heaps,the player who pic 阅读全文