假定你开去香格里拉。出发前油箱是满的，可以行驶D公里。路上一共有n个加油站，A[i]表示从第i-1加油站到第i个的距离。最后一个加油站在香格里拉。请设计算法帮助驾驶员选择加油站使加油的次数最少-Suppose you open to the Shangri-La. Tank is full before departure, you can drive D km. A total of n-way stations, A [i] that from the first i-1 i-station to the distance. The last gas station in the Shangri-La. Please help the driver choose the design algorithm of the least number of gas stations to refuel