摘要：
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take 阅读全文
摘要：
看了很久并没有懂，以下是标程的分析。 好难啊啊啊啊啊 大佬的： 阅读全文
摘要：
1.http://blog.csdn.net/Miracle_ma/article/details/51495549（大牛详解） 2.惭愧，想了很久也没想出来状态应该怎么表达。dp[2][|hA-hB|]:当A和B的高度之差为J时的所用的积木的高度。 3.滚动数组不是很明白。果然我很弱~~~ 不用滚 阅读全文
摘要：
1.这DP写得想哭~~~ 2.好不容易想出dp[i][j][k][l]的状态，却把遍历的顺序写反了（我写的是从后向前，那么t[1],t[2],t[3],t[4]中某项为0时，就崩溃了），导致越写越复杂。 3.orzzzzzzzzz 阅读全文
摘要：
Gappu has a very busy weekend ahead of him. Because, next weekend is Halloween, and he is planning to attend as many parties as he can. Since it's Hal 阅读全文
摘要：
If he would take the cards in the opposite order, i.e. 50, then 20, then 1, the score would be Input The first line of the input contains the number o 阅读全文
摘要：
N堆石子摆成一条线。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的代价。计算将N堆石子合并成一堆的最小代价。 例如： 1 2 3 4，有不少合并方法 1 2 3 4 => 3 3 4(3) => 6 4(9) => 10(19) 1 2 3 阅读全文
摘要：
Just to remind, girls in Arpa's land are really nice. Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weight w 阅读全文