文件名称:shopping_Dynamic_Programming
介绍说明--下载内容均来自于网络,请自行研究使用
Jones先生是一位模范丈夫,每个星期六的早晨他的太太都会给它一个购物清单,他只能购买清单上所列的物品并且必须全部买齐。最开始,Jones先生总是穿梭于商店的过道之间,对每样商品选择最便宜的价格购买,但是他逐渐地厌倦了这种方式,并开始了一种新的尝试——对于商店中的每条过道只走一遍,并严格按照清单上物品的顺序购物。现在你要写一个程序来帮助他购物。你所拥有的信息除了清单所列的物品之外,还包括在他选择的整条路线上依次出现的商品和它的价格,你的任务是计算他购齐所有货物的最小花费。-Mr. Jones is an exemplary husband, every Saturday morning his wife will give it a shopping list, he can only buy listed items must be finished their all. Initially, Mr. Jones always shuttling between the store aisle, every kind of merchandise to choose the cheapest prices, but he gradually tired of this way, and begin a new attempt-- for the stores each aisle only walk again, and in strict accordance with the list of items on the shopping sequence. Now you have to write a program to help him shopping. You have the information in addition to the items listed, also included in his choice of the entire route followed by the commodity and its price, your task is calculating his purchase all goods-the smallest cost.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
shopping_Dynamic_Programming.doc