Description: Design algorithm travel budget data structures and recursive procedures using dynamic programming. Travel budget: a travel agency need to estimate the minimum cost by car one city to another city, along a number of stations, each station is not necessarily the same charges. Tourism budget the following rules apply: If the oil tank more than half of non-stop refueling, unless the oil tank can not support to the next are filled every refueling in a gas station, drivers should spend 2 yuan to buy things eat the driver does not have to prepare for other contingencies and extra oil the car out in the beginning fill the tank computing to the minutes (1 yuan = 100 points). Write a program to estimate the actual cost of a route with the minimum required. C++ achieve
To Search:
File list (Check if you may need any files):
lvguanyusuan.cpp
Download