POJ 2240 http://poj.org/problem?id=2240 题意:判断是否存在使得汇率增多的环 【任意一个点的汇率增多都可以】 Floyd 简单变形 $w[i][j] = max(w[i][j], w[i][k] w[k][j])$ bellman_ford 判断正环 ...
分类:
其他好文 时间:
2020-05-19 18:09:56
阅读次数:
55
#include<iostream> #include<queue> #include<cstdio> #include<cstring> using namespace std; double d[35]; int h[1010],cnt,n,pre[35]; bool vis[35]; stru ...
分类:
其他好文 时间:
2020-01-29 12:24:11
阅读次数:
42
I - Arbitrage 题目链接:https://vjudge.net/contest/66569#problem/I 题目: Arbitrage is the use of discrepancies in currency exchange rates to transform one un ...
分类:
其他好文 时间:
2019-07-20 23:32:38
阅读次数:
99
Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30790 Accepted: 12761 Description Arbitrage is the use of discrepancies in curren ...
分类:
其他好文 时间:
2019-07-19 20:55:15
阅读次数:
101
Arbitrage 题目链接:http://poj.org/problem?id=2240 Description: Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a ...
分类:
其他好文 时间:
2019-02-04 20:56:05
阅读次数:
192
可以参考这篇文章和这个题解 https://www.cnblogs.com/wangyuliang/p/9216365.html https://www.luogu.org/problemnew/solution/SP9340 ...
分类:
其他好文 时间:
2019-01-09 21:45:00
阅读次数:
312
Problem Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of th ...
分类:
编程语言 时间:
2018-12-31 17:27:58
阅读次数:
143
http://poj.org/problem?id=2240 Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into m ...
分类:
其他好文 时间:
2018-10-16 19:21:50
阅读次数:
92
一、Floyed-Warshall算法 枚举中间点起点终点,对整个图进行松弛操作,就能得到整个图的多源最短路径; 例:POJ2240 Arbitrage Arbitrage is the use of discrepancies in currency exchange rates to trans ...
分类:
其他好文 时间:
2018-09-18 14:57:36
阅读次数:
184
floyd可用于解决某些可传递性问题(如1<2,2<3,则1<3 ) POJ2240:http://poj.org/problem?id=2240 Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 28138 A ...
分类:
其他好文 时间:
2018-09-11 21:08:20
阅读次数:
141