文件名称:jiayouzhan
介绍说明－－下载内容均来自于网络，请自行研究使用
【汽车加油问题】一辆汽车加满油后可以行驶N千米。旅途中有若干个加油站。若要使沿途的加油次数最少，设计一个有效的算法，指出应在那些加油站停靠加油。并证明你的算法能产生一个最优解。-[Problem] auto fuel fill up a car after driving N km. There are several gas stations journey. To make the least number of refueling along the way to design an efficient algorithm, that should stop those gas station refueling. And prove that your algorithm produces an optimal solution.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
input.txt
汽车加油.cpp
汽车加油.cpp