Top up after a car traveling n kilometers. The road has a number of gas stations. Design an effective algorithm that should be docked at what gas stations come on, so come on the least number of along the way. Programming tasks: For a given n and k (k < = 10000) the location of gas stations, at least come on the number of computing programming.

2
.\汽车加油.rar

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