该博客讨论了一种工厂机器布局问题，目标是设计一条组装线使得货架宽度最小。机器间通过'I'型和'L'型管道连接，每台机器可能从零到两台其他机器获取原料。问题被转换成一棵倒置的二叉树，通过记忆化递归的方法解决，寻找每个节点（机器）及其子节点的最窄宽度。博客提供了样例输入和输出，以及解决问题的策略和AC代码。
In a typical assembly line, machines are connected one by one. The first machine's output product will be the second machine's raw material. To simplify the problem, we put all machines into a two-dimension shelf. Every machine occupied exactly one grid and has two input ports and only one output port. One input port can get material from only one machine.
Pipes will be used to connect between these machines. There are two kinds of pipes : 'I' kind and 'L' kind. We should notice that the 'I' kind pipe can be linked one by one. Each pipe will also occupied one grid.
In Bob's f
最低0.47元/天 解锁文章
596
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
