本文介绍了盘子运输公司的成本分析问题，公司在打包盘子发货过程中发现花费了大量的时间和金钱。问题在于盘子需要先堆叠起来再放入运输箱。为了降低成本，需要将不同制造商的盘子组合成一个堆栈，允许的操作包括分割和合并。分割是将一个堆栈分为两个，合并是将两个堆栈按正确顺序叠加在一起，但只有当顶部堆栈的底部盘子不大于底部堆栈的顶部盘子时才能进行。题目要求找到将所有堆栈合并为一个堆栈所需的最小操作数。输入包含堆栈数量和每个堆栈的盘子直径，输出是最小操作数。
Description
The Plate Shipping Company is an Internet retailer that, as their name suggests, exclusively sells plates. They pride themselves in offering the widest selection of dinner plates in the universe from a large number of manufacturers.
In a recent cost analysis the company has discovered that they spend a large amount of money on packing the plates for shipment. Part of the reason is that plates have to be stacked before being put into shipping containers. And apparently, this is taking more time than expected. Maybe you can help.
A shipment of plates consists of plates from several manufacturers. The plates from each manufacturer come stacked, that is, each arranged in a single stack with plates ordered by size (the smallest at the top, the largest at the bottom). We will call such a stackproperly ordered. To ship all these plates, you must combine them into a single stack, again properly ordered. To join the manufacturers' stacks into a single stack, two kinds of operations are allowed:
- Split: a single stack can be split into two stacks by lifting any top portion of the stack and putting it aside to form a new stack.
- Join: two stacks can be joined by putting one on top of the other. This is allowed only if the bottom plate of the top stack is no larger than the top plate of the bottom stack, that is, the joined stack has to be properly ordered.
最低0.47元/天 解锁文章
扫一扫
728
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
