F – Piggy-Bank （完全背包）
Before ACM can do anything, a budget must b …
完全背包—-两个for循环的先后问题（转）
https://blog.csdn.net/bujuan827/article/details/52 …
关于0-1背包，完全背包的满与非满
max 满：dp[i]=-INF，dp[0]=0; 非满: dp[i]=0 min 满：dp[i]= …
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 …
H – Tickets （简单dp）
Jesus, what a great movie! Thousands of people are …
G – 免费馅饼 （简单dp）
都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅 …
K – The Unique MST（次小生成树）
Given a connected undirected graph, tell if its mi …