|题目分类|动态规划

动态规划

前i个物品所用重量为j的最优值

1.      数字三角形http://blog.csdn.net/darost/article/details/52084942

2.      机器分配http://blog.csdn.net/darost/article/details/52091597

3.      乘积最大(NOIP2000) http://blog.csdn.net/darost/article/details/52131537

4.      单词的划分http://blog.csdn.net/darost/article/details/52137499

5.      小朋友的数字(NOIP2013) http://blog.csdn.net/darost/article/details/52223728

6.      最大子矩阵http://blog.csdn.net/darost/article/details/52351259

7.      过河(NOIP2005) http://blog.csdn.net/darost/article/details/52331982

8.      开餐馆http://blog.csdn.net/darost/article/details/52419508

9.      奶牛的锻炼http://blog.csdn.net/darost/article/details/52425932

10.  大盗阿福http://blog.csdn.net/darost/article/details/52433361

11.  核电站http://blog.csdn.net/darost/article/details/52496969

12.  酒鬼http://blog.csdn.net/darost/article/details/52496975

13.  守望者的逃离(NOIP2007) http://blog.csdn.net/darost/article/details/52729968

14.  租用游艇http://blog.csdn.net/darost/article/details/53048569

15.  接苹果http://blog.csdn.net/darost/article/details/53057217

16.  美元汇率http://blog.csdn.net/Darost/article/details/53089115

前i个物品差值为j的最优值

1.      多米诺骨牌http://blog.csdn.net/darost/article/details/52517823

2.      搭建双塔http://blog.csdn.net/darost/article/details/52344013

以xx结尾的最优值

最长(不)上升/下降、最长公共子序列

1.      求最长不下降序列http://blog.csdn.net/darost/article/details/52085795

2.      拦截导弹(NOIP1999)  http://blog.csdn.net/darost/article/details/52086240

3.      合唱队形(NOIP2004)  http://blog.csdn.net/darost/article/details/52088231

4.      小胖的水果http://blog.csdn.net/darost/article/details/52346499

5.      神秘的咒语http://blog.csdn.net/darost/article/details/52354660

6.      LCIS http://blog.csdn.net/darost/article/details/52403563

7.      最大上升子序列和http://blog.csdn.net/darost/article/details/52357324

8.      低价购买http://blog.csdn.net/darost/article/details/52517212

9.      红牌http://blog.csdn.net/darost/article/details/53148222

二维

1.      盖房子http://blog.csdn.net/darost/article/details/52333866

2.      创意吃鱼法http://blog.csdn.net/darost/article/details/52713265

i..j区间最优值

1.      沙子合并(NOI1995) http://blog.csdn.net/darost/article/details/52129637

2.      能量项链(NOIP2016) http://blog.csdn.net/darost/article/details/52723720

根据题意多维

1.      方格取数(NOIP2000) http://blog.csdn.net/darost/article/details/52133416

2.      传纸条(NOIP2008) http://blog.csdn.net/darost/article/details/52150553

3.      计算字符串距离http://blog.csdn.net/darost/article/details/52355377

4.      乌龟棋(NOIP2010) http://blog.csdn.net/darost/article/details/52713621

记忆化搜索

1.      滑雪http://blog.csdn.net/darost/article/details/52135137

存在性状态

1.      垃圾陷阱http://blog.csdn.net/darost/article/details/52727341

简单树形DP

1.      Anniversary party http://blog.csdn.net/darost/article/details/52542362

树上背包

1.      选课http://blog.csdn.net/darost/article/details/52555114

2.      The more, The Better http://blog.csdn.net/darost/article/details/52556094