Description: Problem Description: After the fill up a car can travel nkm, the road there are several gas stations, to design an effective algorithm
That should stop refueling stations in which to refuel along the least number.
Algorithm Design: For a given n and k a gas station location, calculate the number of minimum fuel.
Data entry input data given by the file input.txt. The first line has two positive integers n and k, that can travel after the vehicle refueling
The nkm, and k gas stations in the journey, the next line of k+1 integers in that the first k-k-1 gas station with fuel pump
The distance between stations, gas stations, said the starting 0, the car has been fill up. K+1 gas stations, said first destination,
The resulting output: the calculation of the minimum number of fuel output to the file output.txt If you can not reach the destination, the output "no
solution ".
Input file: output file:
input.txt output.txt
774
12,345,166
To Search:
File list (Check if you may need any files):
qichejiayouwenti.cpp
Download