文件名称:jiayou
介绍说明－－下载内容均来自于网络，请自行研究使用
假定你开去香格里拉。出发前油箱是满的，可以行驶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-station to the distance. Finally, a gas station in the Shangri-La. Please design algorithms to help the driver choose the least number of refueling stations to make
(系统自动生成,下载前可以参看下载内容)
下载文件列表
jiayou\build\classes\Main.class
......\build.xml
......\manifest.mf
......\nbproject\build-impl.xml
......\.........\genfiles.properties
......\.........\private\private.properties
......\.........\.......\private.xml
......\.........\project.properties
......\.........\project.xml
......\src\Main.java
......\build\classes
......\nbproject\private
......\build
......\nbproject
......\src
......\test
jiayou
......\build.xml
......\manifest.mf
......\nbproject\build-impl.xml
......\.........\genfiles.properties
......\.........\private\private.properties
......\.........\.......\private.xml
......\.........\project.properties
......\.........\project.xml
......\src\Main.java
......\build\classes
......\nbproject\private
......\build
......\nbproject
......\src
......\test
jiayou