- Category:
- CSharp
- Tags:
-
[WORD]
- File Size:
- 69kb
- Update:
- 2014-03-16
- Downloads:
- 0 Times
- Uploaded by:
- gut
Description: You can fill up a car after driving N kilometers. There are several gas stations journey. To make the minimum number of refueling along the way to design an efficient algorithm, pointed at those stations should stop refueling. Algorithm and prove that you can produce an optimal solution.
To Search:
File list (Check if you may need any files):
addGas-greed.doc
Download