the route

来源: adamsmth 2008-09-30 08:04:20 [] [旧帖] [给我悄悄话] 本文已被阅读: 次 (654 bytes)
本文内容已被 [ adamsmth ] 在 2008-10-02 14:54:46 编辑过。如有问题,请报告版主或论坛管理删除.
回答: by the method of 康MM, the best result is 162.69adamsmth2008-09-30 06:25:56
A(0)---x2------x1----x3------x4----x6------x5----B(x7=1000)
|---t1-------->|~~~~~|~~~~~~~|~~~~~|~~~~~~~|~~~~~|
~~~~~~~|<--t2--|~~~~~|~~~~~~~|~~~~~|~~~~~~~|~~~~~|
~~~~~~~|--------t3-->|--t4-->|--------t5-->|~~~~~|
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|<--t6--|~~~~~|
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|--------t7-->|

1. take #2,#3 to x1
2. back, pick up #5 and meet #4 at x2
3. meet #2, change #2 and #5 at x3
4. meet #3, change #3 and #4 at x4
5. leave #2,#3 at x5
6. back and meet #4,#5 at x6
7. all persons arrive B at same time

Note: if you repeat from t3 to t6 for N times, you can get better result.
请您先登陆,再发跟帖!

发现Adblock插件

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

关闭Adblock后 请点击

请参考如何关闭Adblock/Adblock plus

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

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