ppt 例题8 多重背包3

物品   1       2          3        4         5       6

价值   1       2          3        4         5       6

个数   4        7          4        5         9       1

      

 

0123456789101112131415161718192021222324252627

28

 

 1 0 0 0 0 0 0 00 0 0 0 0 0 0 0 0 0 0 0 0 0 0

 0

 

 

 dp[0] = 1;

 

 

 

 

 

 

 

 

 

 

 物品种类  i= 1

0123456789101112131415161718192021222324252627

28

 

 1 1 1 1 0 0 0 00 0 0 0 0 0 0 0 0 0 0 0 0 0 0

 0

 初值 价值 j=0          

价值为v[i=1]               t=j +k*v[i]   1  2  3  4

                                     t=0 +      1  *  1                                                  

                                                           t=0+      2 *   1        

                                                           t=0 +      3 *   1  

                                                           t=0 +      4 *   1           

                                                              j=0     c[i]

 

 

 

 

 

 

 

 

 

 

 

j= 4  3   2  1  

                                    j=4

价值为v[i=2]               t=j +k*v[i]          t  6  8 10 12 14  16  18

                                                          t=4 +      1  *  2                                                  

                                                           t=4 +      2 *   2            

                                                           t=4 +      3 *   2

            

                                                           t=4 +      7 *   2            

                                                                         c[i]

 

 

 

0123456789101112131415161718192021222324252627

28

 

 1 1 1 11 0 10 10 0 1 0 1 0 1 0 1 0 0 0 0 0 0

 0

 

 

 

                                   j=3

价值为v[i=2]               t=j +k*v[i]          t  5  7   9  11   13  15  17

                                                          t=3 +      1  *  2                                                  

                                                           t=3 +      2 *   2            

                                                           t=3 +      3 *   2

            

                                                           t=3 +      7 *   2            

                                                                         c[i]

 

 

 

 

 

                                   j=2

价值为v[i=2]               t=j +k*v[i]          t  4  6   8  10   12  14  16

                                                          t=2 +      1  *  2                                                  

                                                           t=2 +      2 *   2            

                                                           t=2 +      3 *   2

            

                                                           t=2 +      7 *   2            

                                                                         c[i]

 

 

 

 

 

 

                              j=1

价值为v[i=2]               t=j +k*v[i]          t  3   5   7   9   11  13  15

 

                                                          t=1 +      1  *  2                                                  

                                                           t=1 +      2 *   2            

                                                           t=1 +      3 *   2

         

 

                                                           t=2 +      7 *   2            

 

                                                                         c[i]

 

 

 

 

 

0123456789101112131415161718192021222324252627

28

 

 1 1 1 11 1 11 11 1 1 1 1 1 1 1 1 0 0 0 0 0 0

 0

 

 

 

转载于:https://www.cnblogs.com/2014acm/p/3919123.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值