Description: Top up after a car traveling n kilometers. The road has a number of gas stations. Design an effective algorithm that should be docked at what gas stations come on, so come on the least number of along the way. Programming tasks: For a given n and k (k < = 10000) the location of gas stations, at least come on the number of computing programming.
- [SXXHLB] - data structure for curriculum design, tw
- [POST] - The problem of location selection of pos
- [translation] - National transport algorithm for the sho
- [Olympic_thesis] - Programming the International Olympic Co
File list (Check if you may need any files):
2
.\汽车加油.rar
Download