Introduction - If you have any usage issues, please Google them yourself
Fill up the car after driving an n km. There are several gas stations journey. Design an efficient algorithm, which pointed out that should stop refueling stations in that the least number of refueling along the way. For a given n (n < = 5000) and k (k < = 1000) gas station location, programmed to calculate minimum number of refueling.