Description: Vehicle refueling problem: Fill up the car after driving N kilometers, bound car from A to B, on the way there are K gas station, known both AB distance from the nearest gas station and various gas stations and The distance between (the distance between the various stations are not exactly equal). Design an effective greedy algorithm makes the least number of refueling along the way, and that should be what stops refueling stations
To Search:
File list (Check if you may need any files):
huodonganpai.cpp
Download