Description: A fill up the car after running kilometers n. The journey with a plurality of gas station. The design of an efficient algorithm, point out should be in which gas station refueled, make along the least number of refueling. And to prove that the algorithm can produce an optimal solution.
To Search:
File list (Check if you may need any files):
car.doc
Download