回复:可能是这样

来源: 火球魔法 2008-09-23 21:39:00 [] [博客] [旧帖] [给我悄悄话] 本文已被阅读: 次 (570 bytes)
本文内容已被 [ 火球魔法 ] 在 2008-10-02 14:54:46 编辑过。如有问题,请报告版主或论坛管理删除.
Intuitively, to have 2 and 4 both in the car is not optimal, because 4 walks faster than 3. So it's always better to just have 3 in the car whenever 2 is in the car.

So morefun is right. Just have 4,5 on the car and 2,3 on the car and compute x, y.

In general, the slowest always drives the car, and the rest are sorted from low to high and then are divided in groups of size (n-1), where n is the capacity of the car. In each group the slowest person represents the speed of the whole group. Then the problem reduces to computer x_i for each group i.
请您先登陆,再发跟帖!

发现Adblock插件

如要继续浏览
请支持本站 请务必在本站关闭/移除任何Adblock

关闭Adblock后 请点击

请参考如何关闭Adblock/Adblock plus

安装Adblock plus用户请点击浏览器图标
选择“Disable on www.wenxuecity.com”

安装Adblock用户请点击图标
选择“don't run on pages on this domain”