动态规划专题 动态规划专题 必考题型 HDU 1024 Max Sum Plus Plus HDU 1029 Ignatius and the Princess IV HDU 1069 Monkey and Banana HDU 1074 Doing Homework HDU 1087 Super Jumping! Jumping! Jumping! HDU 1114 Piggy-Bank HDU 1176 免费馅饼 HDU 1260 Tickets HDU 1257 最少拦截系统 HDU 1160 FatMouse's Speed POJ 1015 Jury Compromise POJ 1458 Common Subsequence POJ 1661 Help Jimmy POJ 2533 Longest Ordered Subsequence POJ 3186 Treats for the Cows HDU 1078 FatMouse and Cheese HDU 2859 Phalanx POJ 3616 Milking Time POJ 3666 Making the Grade POJ 1837 Balance http://www.cnblogs.com/ohyee/p/5433389.html POJ 1276 Cash Machine http://www.cnblogs.com/ohyee/p/5444176.html POJ 3267 The Cow Lexicon POJ 1836 Alignment http://www.cnblogs.com/ohyee/p/5449931.html POJ 1260 Pearls http://www.cnblogs.com/ohyee/p/5450951.html POJ 2533 Longest Ordered Subsequence http://www.cnblogs.com/ohyee/p/5451491.html POJ 3176 Cow Bowling http://www.cnblogs.com/ohyee/p/5451752.html POJ 1080 Human Gene Functions POJ 1159 Palindrome 动态规划问题，最重要的是确定状态，找出动态转移方程 其经典类型有 背包问题 最长上升子序列 最长公共子序列