把做过的dp题链接汇总到这里,以后做过的会陆续添加进来。
http://blog.youkuaiyun.com/wiking__acm/article/details/7864305
线性模型http://blog.youkuaiyun.com/wiking__acm/article/details/8267820
把一个串划分成个数最少的回文串
线性模型
http://blog.youkuaiyun.com/wiking__acm/article/details/8286270
线性模型
http://blog.youkuaiyun.com/wiking__acm/article/details/9374185
线性模型
http://blog.youkuaiyun.com/wiking__acm/article/details/10032723
线性模型
http://blog.youkuaiyun.com/wiking__acm/article/details/7868281
在一个带权矩阵上移动,求一个权和最大的路径。经典模型,只是这题加了一个限制,下一步的权必须比当前格的权大。
http://blog.youkuaiyun.com/wiking__acm/article/details/8374239
在一个带权矩阵上移动,求最大权路径,需要单调队列优化
http://blog.youkuaiyun.com/wiking__acm/article/details/8350909
矩阵上找路径
http://blog.youkuaiyun.com/wiking__acm/article/details/8288196
需要分析策略,得到最优化转移策略的矩阵上的dp
http://blog.youkuaiyun.com/wiking__acm/article/details/9731753
矩阵上的路径
http://blog.youkuaiyun.com/wiking__acm/article/details/9989675
矩阵
http://blog.youkuaiyun.com/wiking__acm/article/details/8270283
最长上升子序列经典模型
http://blog.youkuaiyun.com/wiking__acm/article/details/8903103
最长上升子序列变形
http://blog.youkuaiyun.com/wiking__acm/article/details/10049033
最长上升子序列
http://blog.youkuaiyun.com/wiking__acm/article/details/10052169
最长上升子序列
http://blog.youkuaiyun.com/wiking__acm/article/details/10024999
完全背包
http://blog.youkuaiyun.com/wiking__acm/article/details/10036319
区间dp
http://blog.youkuaiyun.com/wiking__acm/article/details/10045473
01背包
http://blog.youkuaiyun.com/wiking__acm/article/details/10047991
01背包
http://blog.youkuaiyun.com/wiking__acm/article/details/7603315
一个数n拆成若干个质数和,有多少种情况
套用经典背包模型
http://blog.youkuaiyun.com/wiking__acm/article/details/10066987
完全背包
http://blog.youkuaiyun.com/wiking__acm/article/details/10112441
http://blog.youkuaiyun.com/wiking__acm/article/details/10066987
经典问题
http://blog.youkuaiyun.com/wiking__acm/article/details/10264411
博弈型的状态转移
http://blog.youkuaiyun.com/wiking__acm/article/details/8236351
最大连续和的经典模型,只是变成了二维加环
http://blog.youkuaiyun.com/wiking__acm/article/details/8916611
经典floyed问题的变形
http://blog.youkuaiyun.com/wiking__acm/article/details/10028973
入门dp