区间dp详解（转）
https://blog.csdn.net/my_sunshine26/article/detail …
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 …
完全背包—-两个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 …