poj1860 Currency Exchange（货币交换,最短路问题）

最新推荐文章于 2017-11-13 14:58:54 发布

twobqn123

最新推荐文章于 2017-11-13 14:58:54 发布

阅读量738

点赞数

分类专栏：图论-最短路问题

本文链接：https://blog.csdn.net/twobqn123/article/details/17291511

版权

这篇博客详细介绍了POJ1860题目，探讨了货币交换问题如何转化为最短路径问题，并提供了输入、输出格式及样例，帮助读者理解解题思路。

摘要由CSDN通过智能技术生成

Currency Exchange

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 17436		Accepted: 6112

Description

Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can be several points specializing in the same pair of currencies. Each point has its own exchange rates, exchange rate of A to B is the quantity of B you get for 1A. Also each exchange point has some commission, the sum you have to pay for your exchange operation. Commission is always collected in source currency.
For example, if you want to exchange 100 US Dollars into Russian Rubles at the exchange point, where the exchange rate is 29.75, and the commission is 0.39 you will get (100 - 0.39) * 29.75 = 2963.3975RUR.
You surely know that there are N different currencies you can deal with in our city. Let us assign unique integer number from 1 to N to each currency. Then each exchange point can be descri