难度：1
前提：算法
后继：动态规划 II，状态压缩 DP，树形 DP，LIS 问题，LCS 问题
资料：
- https://en.wikipedia.org/wiki/Dynamic_programming
- http://www.csie.ntnu.edu.tw/~u91029/DynamicProgramming.html
- http://codeforces.com/problemset/tags/dp
- https://community.topcoder.com/tc?module=ProblemArchive&sr=&er=&sc=&sd=&class=&cat=Dynamic+Programming&div1l=&div2l=&mind1s=&mind2s=&maxd1s=&maxd2s=&wr=
- http://www.spoj.com/problems/tag/dynamic-programming
- https://vijos.org/p/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92
Alca
Amber
Belleve Invis
Chensiting123
Edward_mj
Fotile96
Hlworld
Kuangbin
Liyaos
Lwins
LYPenny
Mato 完整版
Mikeni2006
Mzry
Nagatsuki
Neko13
Oneplus
Rukata
Seter
Sevenkplus
Sevenzero
Shirleycrow
Vfleaking
wangzhpp
Watashi
WJMZBMR
Wywcgs
XadillaX
Yangzhe
三途川玉子
About.me
Vijos
