说明：  一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。 编程任务： 对于给定的n和k(k <= 10000)个加油站位置，编程计算最少加油次数。
(Top up after a car traveling n kilometers. The road has a number of gas stations. Design an effective algorithm that should be docked at what gas stations come on, so come on the least number of along the way. Programming tasks: For a given n and k (k < = 10000) the location of gas stations, at least come on the number of computing programming.)