文件名称:TK
介绍说明--下载内容来自于网络,使用问题请自行百度
旅行家问题 一个旅行家想驾驶汽车以最少的费yi 用从一个城市到另一个城市(假设出发时油箱是空的)。给定两个城市之间的距离为D1、汽车油箱的容量为C(以升为单位),每升汽油能行驶的距离为 D2,出发点每升汽油价格P和沿途油站数N(N可以为零),油站i离出发点距离Di,每升汽油价格Pi(i=1,2...N)。计算结果四舍五入至小数点后两位。 如果无法到达目的地,则输出“No Solution\"。-issue a travel home to travel home to drive a car with the minimum of cost yi used from one city to another city (assuming starting at the fuel tank was empty). Given the two cities for the distance between D1, car fuel tank capacity of the C (in liters) per liter petrol traveling distance to the D2, the starting point liter gasoline prices P and several petrol stations along the N (N can be zero), PFS i distance from the starting point Di per liter Steam oil prices Pi (i = 1,2 ... N). Calculation results rounded to two decimal places. If unable to reach their destination, the export of "No Solution."
(系统自动生成,下载前可以参看下载内容)
下载文件列表
TK.C
www.dssz.com.txt
www.dssz.com.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.