您好, 欢迎来到 !    登录 | 注册 | | 设为首页 | 收藏本站
问答- 问题:箱子堆放问题

箱子堆放问题

箱子堆放问题

=============
=           =
=           =
=           = L
=     H     =
=           =
=           =
=============   
      W


==================
=                =
=                =  
=       W        = L
=                =
=                =
==================
        H


D[1] = h(1);
D[i] = h(i) + max(D[j] | j < i, we can put block i on top of block j)

Answer is the max element of D.

其他 2022/1/1 18:13:49 有402人围观

撰写回答

你尚未登录，登录后可以

和开发者交流问题的细节

关注并接收问题和回答的更新提醒

参与内容的编辑和改进，让解决方法与时俱进

请先登录

推荐问题

联系我

联系我

602392714

清零编程清零编程群

置顶