设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。
Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling.
设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。
Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling.
应用推荐