<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>背包问题 on 敲代码的朱雀</title>
    <link>https://www.cosefinch.com/tags/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98/</link>
    <description>Recent content in 背包问题 on 敲代码的朱雀</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-cn</language>
    <lastBuildDate>Thu, 07 May 2026 07:28:00 +0800</lastBuildDate><atom:link href="https://www.cosefinch.com/tags/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>P2015 二叉苹果树</title>
      <link>https://www.cosefinch.com/posts/p2015-binary-apple-tree/</link>
      <pubDate>Thu, 07 May 2026 07:28:00 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p2015-binary-apple-tree/</guid>
      <description>
        
          
            通过树形DP在二叉树结构上进行背包决策，求保留指定树枝数时的最大苹果数
          
          
        
      </description>
    </item>
    
    <item>
      <title>P1776 宝物筛选</title>
      <link>https://www.cosefinch.com/posts/p1776-treasure-screening/</link>
      <pubDate>Tue, 05 May 2026 21:20:00 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p1776-treasure-screening/</guid>
      <description>
        
          
            多重背包问题，通过二进制拆分将每种物品拆成若干个 0/1 背包物品，再用经典 DP 求最大价值
          
          
        
      </description>
    </item>
    
    <item>
      <title>P1049 装箱问题</title>
      <link>https://www.cosefinch.com/posts/p1049-box-packing/</link>
      <pubDate>Tue, 05 May 2026 20:44:06 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p1049-box-packing/</guid>
      <description>
        
          
            用尽量少的箱子装物品，每个箱子容量固定 m，求最小剩余空间，本质是容量为 m 的 0-1 背包。
          
          
        
      </description>
    </item>
    
    <item>
      <title>P1616 疯狂的采药</title>
      <link>https://www.cosefinch.com/posts/p1616-crazy-herb-picking/</link>
      <pubDate>Tue, 05 May 2026 11:47:45 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p1616-crazy-herb-picking/</guid>
      <description>
        
          
            每种草药可以无限次采摘的完全背包问题，通过正序遍历实现状态转移，求在规定时间内采药的最大总价值。
          
          
        
      </description>
    </item>
    
    <item>
      <title>P1048 采药</title>
      <link>https://www.cosefinch.com/posts/p1048-herbal-medicine/</link>
      <pubDate>Tue, 05 May 2026 09:35:56 +0800</pubDate>
      
      <guid>https://www.cosefinch.com/posts/p1048-herbal-medicine/</guid>
      <description>
        
          
            在 T 时间内采若干株药，每种药只能采一次，求最大总价值。经典 0-1 背包模板题。
          
          
        
      </description>
    </item>
    
  </channel>
</rss>