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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．