T1: Tao Tao picking apples
Dynamic maintenance monotonous stack title
ST table maintenance interval maximum value, the inquiry is offline
For each inquiry, two points behind the first big find than his position to get an answer
T2: happy Jinming
greedy
Since the storage of the material is not limited, we first of all to maintain the current price of the cheapest material
First with the cheapest materials create computer
For the present, some computers, select the minimum cost of greedy
The maximum cost-per Kuayue delete greedily
T3: stupid monkey
The source array from small to large, and to (1,2) (3,4) ... (2n-1,2n) rule group divided into n + 1
Each B is selected from the group larger, then the last elected
Look proof solution to a problem, I do not want to write