有 n 辆车,就把一箱分成 n + 1 格,每格能走 120/(n + 1) 千米。每次分油后,继续前进的车都重新满油。第 j 站的支援车可以这样分配它在上一站加满的一箱油:For n bikes, divide a tank into n + 1 shares. One share takes a bike 120/(n + 1) km. Every continuing bike leaves each stop full. At stop j, the returning helper accounts for its tank at the start of this leg as follows.
本段用 1 格 + 给同伴 (n − j) 格 + 回家留 j 格 = n + 1 格1 burned on this leg + (n − j) given to others + j kept for home = n + 1 shares
甲走过 n − 1 段后,还有满箱油可以再走 120 千米。After n − 1 short legs, A has a full tank for a final 120 km.
Dn = 120 + (n − 1) × 120/(n + 1)
也就是 Dₙ = 240 − 240/(n + 1) 千米。每增加车辆,距 240 千米的差距就缩小一点,但只要车辆有限,差距始终大于 0。Equivalently, Dₙ = 240 − 240/(n + 1) km. The gap to 240 km shrinks as the fleet grows, and stays positive for every finite fleet.
提高题:如果把折返点挪一挪,会不会更远?Going further: could unevenly spaced stops do better?
下面允许各段距离任意,也允许续行车辆没有补满。把 120 千米当作 1 个距离单位。由近到远,设第 j 辆支援车在 xⱼ 处折返。Sⱼ 是前 j 个折返距离的和,S₀ = 0。Allow any lengths for the legs and any legal fuel transfers. Measure distance in units of 120 km. Let xⱼ be the distance from home to turnaround j in outward order. Write Sⱼ for the sum of the first j turnaround distances, with S₀ = 0.
- 到第 j 站分油后,前 j 辆支援车走完全程往返共需 2Sⱼ 箱,其中包含已留下的返程油。其余 n − j 辆各已用掉 xⱼ 箱,且各自最多还装 1 箱。总油量为 n 箱,所以 n ≤ 2Sⱼ + (n − j)xⱼ + (n − j)。At stop j, the first j helpers account for 2Sⱼ tanks for their complete round trips, including the fuel reserved for coming home. Each of the remaining n − j bikes has burned xⱼ tanks and can now hold at most one. Accounting for all n starting tanks gives n ≤ 2Sⱼ + (n − j)xⱼ + (n − j).
- 代入 xⱼ = Sⱼ − Sⱼ₋₁,整理得 (n − j + 2)Sⱼ ≥ j + (n − j)Sⱼ₋₁。右边随上一项增大而增大。等距方案每次都让续行车辆满油,所以从 S₀ = 0 起,每一步都恰好取等号。逐站比较,其他方案的 Sⱼ 都不会更小。Substitute xⱼ = Sⱼ − Sⱼ₋₁ and rearrange to get (n − j + 2)Sⱼ ≥ j + (n − j)Sⱼ₋₁. A larger previous sum can only raise the lower bound. The equal-leg plan fills every continuing tank, so it gives equality at each step. Starting at S₀ = 0, no other plan can have a smaller sum at any step.
- 所有油最终耗尽。支援车共耗 2Sₙ₋₁ 箱,所以留给甲全程消耗的油是 n − 2Sₙ₋₁ 箱。等距方案使 Sₙ₋₁ 最小,因而甲走得最远。All starting fuel is burned. The helpers use 2Sₙ₋₁ tanks on their round trips, leaving n − 2Sₙ₋₁ tanks for A’s whole journey. The equal-leg plan minimizes that sum and therefore maximizes A’s distance.