摘要:
浅谈$DP$: "https://www.cnblogs.com/AKMer/p/10437525.html" 题目传送门: "https://www.luogu.org/problemnew/show/P1616" $01$背包: "https://www.cnblogs.com/AKMer/p/ 阅读全文
摘要:
浅谈$DP$: "https://www.cnblogs.com/AKMer/p/10437525.html" 题目传送门: "https://www.luogu.org/problemnew/show/P1048" 像这种给你$n$个物品,每个物品有占用体积和价值,求$m$体积的背包能装下的最大的 阅读全文
摘要:
浅谈$DP$: "https://www.cnblogs.com/AKMer/p/10437525.html" 题目传送门: "https://www.luogu.org/problemnew/show/P1140" 以已经匹配完了的长度为阶段,$f[i][j]$为状态,表示已匹配了第一个串的$i$ 阅读全文
摘要:
浅谈$DP$: "https://www.cnblogs.com/AKMer/p/10437525.html" 题目传送门: "https://www.luogu.org/problemnew/show/P1004" 设$f[i][j][k][l]$表示第一条路从$(1,1)$走到$(i,j)$,第 阅读全文
摘要:
浅谈$DP$: "https://www.cnblogs.com/AKMer/p/10437525.html" 题目传送门: "http://acm.hdu.edu.cn/showproblem.php?pid=1423" 最长上升子序列: "https://www.cnblogs.com/AKMe 阅读全文
摘要:
浅谈$DP$: "https://www.cnblogs.com/AKMer/p/10437525.html" 题目传送门: "https://www.luogu.org/problemnew/show/P1439" 设$f[i][j]$表示在$a$序列中$[1,i]$和$b$序列的$[1,j]$的 阅读全文
摘要:
浅谈$DP$: "https://www.cnblogs.com/AKMer/p/10437525.html" 题目传送门: "https://www.luogu.org/problemnew/show/AT2827" $LIS$就是$Longest$ $Increasing$ $Subsequen 阅读全文
摘要:
浅谈状态空间: "https://www.cnblogs.com/AKMer/p/9622590.html" 所谓$DP$,就是$Dynamic$ $programming$,动态规划算法。 $OI$中大部分问题的本质是解决对状态空间的遍历以及处理,而$DP$则是针对某一类满足特定条件的问题,对状态 阅读全文