details

|----t1------>|
A(0)---x2------x1------x3------x4----x6------x5----------B(1000)
|<--t2--| |<--t6--|
|------t3------>|--t4-->|----t5------>|
|------------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.

Result (N=1):
t=165.23

x2=283.19
x1=495.58
x3=601.77
x4=677.62
x6=829.33
x5=943.11
x7=1000

t1=49.56
t2=21.24
t3=31.86
t4= 7.59
t5=26.55
t6=11.38
t7=17.07


Repeat N times:
N=1: t=165.234
N=2: t=163.811
N=3: t=163.237
N=4: t=162.969
N=5: t=162.834
N=6: t=162.765
N=7: t=162.728
N=8: t=162.709
N=9: t=162.698
N=10: t=162.693
N=11: t=162.690
N=12: t=162.688

所有跟帖： 

• the route -adamsmth- ♂ (654 bytes) () 09/30/2008 postreply 08:04:20

• 貌似有问题... -火球魔法- ♂ (422 bytes) () 09/30/2008 postreply 12:42:09

• it is the text 有问题, the result is right -adamsmth- ♂ (87 bytes) () 10/31/2008 postreply 09:46:22