K – Jury Compromise POJ 1015 （以题中较小数据范围的数据入手的dp）
Time Limit:1000MS Memory Limit:65536KB 64bit IO Fo …
M – Help Jimmy（ms或dp）
这题算是比经典的一种dp问题，解法就是搭建好下层求出上层，ms或者dp都可。 R …
R – Milking Time （最大不重叠子片段和）
Bessie is such a hard-working cow. In fact, she is …
Q – Phalanx (递推对称矩阵)
Today is army day, but the servicemen are busy wit …
P – FatMouse and Cheese
FatMouse has stored some cheese in a city. The cit …
F – Piggy-Bank （完全背包）
Before ACM can do anything, a budget must b …
C – Monkey and Banana （最高矩形嵌套）
A group of researchers are designing an experiment …
E – Super Jumping! Jumping! Jumping! （最大递增子序列和）
Nowadays, a kind of chess game called “Super Jumpi …
N – Longest Ordered Subsequence (LIS)
A numeric sequence of ai is ordered if a1 < a2 …
L – Common Subsequence （LCS+滚动数组）
A subsequence of a given sequence is the given seq …