摘要：
N堆石子摆成一条线。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的代价。计算将N堆石子合并成一堆的最小代价。 例如： 1 2 3 4，有不少合并方法 1 2 3 4 => 3 3 4(3) => 6 4(9) => 10(19) 1 2 3 阅读全文
摘要：
Problem Description Ruins is driving a car to participating in a programming contest. As on a very tight schedule, he will drive the car without any s 阅读全文
摘要：
Long long ago there is a strong tribe living on the earth. They always have wars and eonquer others. One day, there is another tribe become their targ 阅读全文
摘要：
Alice and Bob's game never ends. Today, they introduce a new game. In this game, both of them have N different rectangular cards respectively. Alice w 阅读全文