在Android# PDA - 掌中宝
t*e
1 楼
There are n petrol bunks arranged in circle. Each bunk is separated from
the rest by a certain distance. You choose some mode of travel which needs
1litre of petrol to cover 1km distance. You can't infinitely draw any
amount of petrol from each bunk as each bunk has some limited petrol only.
But you know that the sum of litres of petrol in all the bunks is equal to
the distance to be covered.
ie let P1, P2, ... Pn be n bunks arranged circularly. d1 is distance
between p1 and p2, d2 is distance b
the rest by a certain distance. You choose some mode of travel which needs
1litre of petrol to cover 1km distance. You can't infinitely draw any
amount of petrol from each bunk as each bunk has some limited petrol only.
But you know that the sum of litres of petrol in all the bunks is equal to
the distance to be covered.
ie let P1, P2, ... Pn be n bunks arranged circularly. d1 is distance
between p1 and p2, d2 is distance b