Description: Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution
File list (Check if you may need any files):
加油站问题\input.txt
..........\新建 Microsoft Word 文档.doc
..........\汽车加油.cpp
加油站问题
Download