https://www.cosefinch.com/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/ Recent content in 动态规划 on 敲代码的朱雀 Hugo -- gohugo.io zh-cn Fri, 08 May 2026 10:09:14 +0800 https://www.cosefinch.com/posts/p1063-energy-necklace/ Fri, 08 May 2026 10:09:14 +0800 https://www.cosefinch.com/posts/p1063-energy-necklace/ 将环形能量项链展开为线性区间DP，通过枚举最后一次聚合的分割点求最大能量 https://www.cosefinch.com/posts/p1868-hungry-cow/ Fri, 08 May 2026 10:02:24 +0800 https://www.cosefinch.com/posts/p1868-hungry-cow/ 在 n 个区间中选取互不重叠的区间，利用线性 DP 求最大覆盖总长度 https://www.cosefinch.com/posts/p2015-binary-apple-tree/ Thu, 07 May 2026 07:28:00 +0800 https://www.cosefinch.com/posts/p2015-binary-apple-tree/ 通过树形DP在二叉树结构上进行背包决策，求保留指定树枝数时的最大苹果数 https://www.cosefinch.com/posts/p1020-missile-interception/ Thu, 07 May 2026 07:11:00 +0800 https://www.cosefinch.com/posts/p1020-missile-interception/ 利用二分查找优化求最长不上升子序列和最长上升子序列，解决导弹拦截系统最少数量问题 https://www.cosefinch.com/posts/p1776-treasure-screening/ Tue, 05 May 2026 21:20:00 +0800 https://www.cosefinch.com/posts/p1776-treasure-screening/ 多重背包问题，通过二进制拆分将每种物品拆成若干个 0/1 背包物品，再用经典 DP 求最大价值 https://www.cosefinch.com/posts/p1049-box-packing/ Tue, 05 May 2026 20:44:06 +0800 https://www.cosefinch.com/posts/p1049-box-packing/ 用尽量少的箱子装物品，每个箱子容量固定 m，求最小剩余空间，本质是容量为 m 的 0-1 背包。 https://www.cosefinch.com/posts/p1616-crazy-herb-picking/ Tue, 05 May 2026 11:47:45 +0800 https://www.cosefinch.com/posts/p1616-crazy-herb-picking/ 每种草药可以无限次采摘的完全背包问题，通过正序遍历实现状态转移，求在规定时间内采药的最大总价值。 https://www.cosefinch.com/posts/p1025-integer-partition/ Tue, 05 May 2026 10:37:57 +0800 https://www.cosefinch.com/posts/p1025-integer-partition/ 将整数 n 分成 k 份（非空，不考虑顺序），求不同的分法数。本文介绍递推 + 递归的经典解法。 https://www.cosefinch.com/posts/p1048-herbal-medicine/ Tue, 05 May 2026 09:35:56 +0800 https://www.cosefinch.com/posts/p1048-herbal-medicine/ 在 T 时间内采若干株药，每种药只能采一次，求最大总价值。经典 0-1 背包模板题。 https://www.cosefinch.com/posts/p1002-crossing-river-pawn/ Mon, 04 May 2026 22:41:57 +0800 https://www.cosefinch.com/posts/p1002-crossing-river-pawn/ 在 n×m 棋盘上避开马的控制点，从 (0,0) 到 (n,m) 的路径数，只能向右或向下走。 https://www.cosefinch.com/posts/p1006-passing-notes/ Mon, 04 May 2026 15:09:00 +0800 https://www.cosefinch.com/posts/p1006-passing-notes/ 小渊和小轩在矩阵对角线上，互相传纸条，求两条路径上的友好指数之和最大值。四维 DP 经典题。 https://www.cosefinch.com/posts/p1216-number-triangle/ Mon, 04 May 2026 14:32:00 +0800 https://www.cosefinch.com/posts/p1216-number-triangle/ 从顶部出发，每次只能走到下一行相邻的位置，求路径上数字之和的最大值。经典 DP 入门题，可用记忆化递归或自底向上递推两种思路解决。