一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效 //



// 算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的 //



// n和k个加油站位置，编程计算最少加油次数。

-Fill up the car after driving an n km. There are a number of gas stations journey. To design an effective//// algorithm, which should be pointed out that the gas station refueling stops, so that the least number of times along the way refueling. For a given//// n and k-station location, the calculation program for at least the number of refueling.