You can fill up a car after driving N kilometers. There are several gas stations journey. To make the minimum number of refueling along the way to design an efficient algorithm, pointed at those stations should stop refueling. Algorithm and prove that you can produce an optimal solution.

addGas-greed.doc

• 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．