还是币种交换问题,只是这里换汇的时候需要支付手续费。转化为最短路径问题,因为有负权路径,用Bellman-Ford 算法。当路径存在负环时就可以无限制刷钱,所以最终肯定是赚的。
//descrption below is added on August 31,2011
We can earn money as long as the negative-circle exists and it connects to source node. Since we just consider node with value larger than 0 when we look for shortest path, all the negative-circle we detect at the end would be connected to the source node.
Eventhough there is no negative-circle sometimes, we still can earn money. Just need to check the final value of node source.