假定你开去香格里拉。出发前油箱是满的，可以行驶D公里。路上一共有n个加油站，A[i]表示从第i-1加油站到第i个的距离。最后一个加油站在香格里拉。请设计算法帮助驾驶员选择加油站使加油的次数最少-Suppose you go through Shangri-La. Tank is full before departure, can travel D km. On the road a total of n stations, A [i] that from the first i-1 i-sta

一辆汽车加满油后可行驶n 公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。并证明算法能产生一个最优解。-A fill up the car after running kilometers n. The journey with a plurality of gas station. The design of an efficient algorithm, point out should be in which gas station refue

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应 在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n(n <= 5000)和k(k <= 1000)个加油站位置，编程计算最少加油次数。-Fill up the car after driving an n km. There are several gas stations journey. Design an efficient algorithm, which pointed out that