经典动态规划合集_牛人 树形,压缩 老题

[{"title":"（ 78 个子文件 13.62MB ） 经典动态规划合集_牛人 树形,压缩 老题","children":[{"title":"动态规划DP","children":[{"title":"总结下最近做的些题目.docx <span style='color:#111;'> 49.54KB </span>","children":null,"spread":false},{"title":"基于连通性状态压缩的动态规划问题_Cdq.ppt <span style='color:#111;'> 850.00KB </span>","children":null,"spread":false},{"title":"部分背包问题（贪心） .docx <span style='color:#111;'> 23.78KB </span>","children":null,"spread":false},{"title":"PKU——DP专辑.pdf <span style='color:#111;'> 142.92KB </span>","children":null,"spread":false},{"title":"题目.txt <span style='color:#111;'> 203B </span>","children":null,"spread":false},{"title":"树形DP.docx <span style='color:#111;'> 15.96KB </span>","children":null,"spread":false},{"title":"部分背包问题（贪心） .pdf <span style='color:#111;'> 239.00KB </span>","children":null,"spread":false},{"title":"压缩状态DP .docx <span style='color:#111;'> 58.08KB </span>","children":null,"spread":false},{"title":"【专辑】插头DP.docx <span style='color:#111;'> 17.86KB </span>","children":null,"spread":false},{"title":"最大矩阵连乘次数(最小连乘变形).docx <span style='color:#111;'> 14.81KB </span>","children":null,"spread":false},{"title":"DP优化 学习小结.docx <span style='color:#111;'> 23.81KB </span>","children":null,"spread":false},{"title":"01背包问题.pdf <span style='color:#111;'> 267.69KB </span>","children":null,"spread":false},{"title":"01背包问题.docx <span style='color:#111;'> 26.59KB </span>","children":null,"spread":false},{"title":"acm动态规划总结.pdf <span style='color:#111;'> 726.34KB </span>","children":null,"spread":false},{"title":"acm动态规划总结.doc <span style='color:#111;'> 490.00KB </span>","children":null,"spread":false},{"title":"【专辑】单调队列+斜率优化的DP.docx <span style='color:#111;'> 24.34KB </span>","children":null,"spread":false},{"title":"动态规划的深入探讨.doc <span style='color:#111;'> 267.00KB </span>","children":null,"spread":false},{"title":"动态规划解抛鸡蛋(玻璃球)问题.docx <span style='color:#111;'> 19.75KB </span>","children":null,"spread":false},{"title":"树型动态规划.docx <span style='color:#111;'> 19.28KB </span>","children":null,"spread":false},{"title":"典型的动态规划,用递归下的记忆化搜索来实现 1088 POJ.pdf <span style='color:#111;'> 84.97KB </span>","children":null,"spread":false},{"title":"用单调性优化动态规划.doc <span style='color:#111;'> 208.00KB </span>","children":null,"spread":false},{"title":"对一些DP题目的小结.docx <span style='color:#111;'> 18.16KB </span>","children":null,"spread":false},{"title":"树形动态规划.doc <span style='color:#111;'> 227.00KB </span>","children":null,"spread":false},{"title":"基于连通性状态压缩的动态规划问题.pdf <span style='color:#111;'> 522.12KB </span>","children":null,"spread":false},{"title":"POJ 动态规划总结.doc <span style='color:#111;'> 538.50KB </span>","children":null,"spread":false},{"title":"动态规划的特点及其应用.doc <span style='color:#111;'> 256.00KB </span>","children":null,"spread":false},{"title":"Dynamic+Programming.pdf <span style='color:#111;'> 4.07MB </span>","children":null,"spread":false},{"title":"8.徐源盛《对一类动态规划问题的研究》","children":[{"title":"对一类动态规划问题的研究.pdf <span style='color:#111;'> 804.82KB </span>","children":null,"spread":false},{"title":"对一类动态规划问题的研究.ppt <span style='color:#111;'> 1.30MB </span>","children":null,"spread":false}],"spread":false},{"title":"01背包问题 .pdf <span style='color:#111;'> 250.22KB </span>","children":null,"spread":false},{"title":"树状dp.pdf <span style='color:#111;'> 263.69KB </span>","children":null,"spread":false},{"title":"动态规划总结2.pdf <span style='color:#111;'> 284.06KB </span>","children":null,"spread":false},{"title":"动态规划.ppt <span style='color:#111;'> 107.50KB </span>","children":null,"spread":false},{"title":"动态规划加速原理之四边形不等式.pdf <span style='color:#111;'> 47.00KB </span>","children":null,"spread":false},{"title":"动态规划“数塔”类型题目总结.docx <span style='color:#111;'> 52.81KB </span>","children":null,"spread":false},{"title":"3.徐持衡《浅谈几类背包题》","children":[{"title":"浅谈几类背包题.ppt <span style='color:#111;'> 1.91MB </span>","children":null,"spread":false},{"title":"浅谈几类背包题.pdf <span style='color:#111;'> 529.64KB </span>","children":null,"spread":false}],"spread":false},{"title":"几道有意思的DP题 .docx <span style='color:#111;'> 27.89KB </span>","children":null,"spread":false},{"title":"完全背包问题 .docx <span style='color:#111;'> 24.79KB </span>","children":null,"spread":false},{"title":"典型的动态规划,用递归下的记忆化搜索来实现 1088 POJ.docx <span style='color:#111;'> 17.83KB </span>","children":null,"spread":false},{"title":"状态DP~.docx <span style='color:#111;'> 15.55KB </span>","children":null,"spread":false},{"title":"01背包问题 .docx <span style='color:#111;'> 39.80KB </span>","children":null,"spread":false},{"title":"PKU——DP专辑.docx <span style='color:#111;'> 15.75KB </span>","children":null,"spread":false},{"title":"树形DP之个人整理总结.doc <span style='color:#111;'> 202.50KB </span>","children":null,"spread":false},{"title":"最长公共子序列和字符串相似度.docx <span style='color:#111;'> 27.11KB </span>","children":null,"spread":false},{"title":"动态规划总结.docx <span style='color:#111;'> 30.35KB </span>","children":null,"spread":false},{"title":"树型动态规划和状态压缩动态规划.ppt <span style='color:#111;'> 172.50KB </span>","children":null,"spread":false},{"title":"背包九讲Pack","children":[{"title":"P06.html <span style='color:#111;'> 2.75KB </span>","children":null,"spread":false},{"title":"P10.muse <span style='color:#111;'> 5.26KB </span>","children":null,"spread":false},{"title":"P05.muse <span style='color:#111;'> 2.76KB </span>","children":null,"spread":false},{"title":"P01.muse <span style='color:#111;'> 5.81KB </span>","children":null,"spread":false},{"title":"P07.html <span style='color:#111;'> 5.36KB </span>","children":null,"spread":false},{"title":"P08.html <span style='color:#111;'> 5.23KB </span>","children":null,"spread":false},{"title":"P04.html <span style='color:#111;'> 3.78KB </span>","children":null,"spread":false},{"title":"P09.html <span style='color:#111;'> 8.59KB </span>","children":null,"spread":false},{"title":"Index.muse <span style='color:#111;'> 4.95KB </span>","children":null,"spread":false},{"title":"P03.html <span style='color:#111;'> 4.74KB </span>","children":null,"spread":false},{"title":"P01.html <span style='color:#111;'> 7.05KB </span>","children":null,"spread":false},{"title":"P06.muse <span style='color:#111;'> 1.72KB </span>","children":null,"spread":false},{"title":"P07.muse <span style='color:#111;'> 4.26KB </span>","children":null,"spread":false},{"title":"P02.muse <span style='color:#111;'> 5.49KB </span>","children":null,"spread":false},{"title":"P11.html <span style='color:#111;'> 5.32KB </span>","children":null,"spread":false},{"title":"P10.html <span style='color:#111;'> 6.40KB </span>","children":null,"spread":false},{"title":"P11.muse <span style='color:#111;'> 4.22KB </span>","children":null,"spread":false},{"title":"P02.html <span style='color:#111;'> 6.73KB </span>","children":null,"spread":false},{"title":"P05.html <span style='color:#111;'> 3.82KB </span>","children":null,"spread":false},{"title":"P08.muse <span style='color:#111;'> 4.16KB </span>","children":null,"spread":false},{"title":"P03.muse <span style='color:#111;'> 3.64KB </span>","children":null,"spread":false},{"title":"P04.muse <span style='color:#111;'> 2.67KB </span>","children":null,"spread":false},{"title":"Index.html <span style='color:#111;'> 7.90KB </span>","children":null,"spread":false},{"title":"P09.muse <span style='color:#111;'> 7.37KB </span>","children":null,"spread":false}],"spread":false},{"title":"动态规划总结.pdf <span style='color:#111;'> 137.89KB </span>","children":null,"spread":false},{"title":"背包之01背包、完全背包、多重背包详解.pdf <span style='color:#111;'> 343.65KB </span>","children":null,"spread":false},{"title":"e200823171356.doc <span style='color:#111;'> 85.50KB </span>","children":null,"spread":false},{"title":"斜率优化DP个人总结.docx <span style='color:#111;'> 17.20KB </span>","children":null,"spread":false},{"title":"树状dp.docx <span style='color:#111;'> 32.97KB </span>","children":null,"spread":false},{"title":"算法导论第15章-动态规划.pdf <span style='color:#111;'> 3.36MB </span>","children":null,"spread":false},{"title":"背包之01背包、完全背包、多重背包详解.docx <span style='color:#111;'> 86.05KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]