UVa OJ 104 – Arbitrage

Problem link https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=40 Hints Floyd-Warshall algorithm Solution code Bibliography JeraKrs. uva 104 – Arbitrage(最短路Floyd). CSDN blog. 2013-10-13 16:20:27 Ruslan Ledesma-Garza, Arbitrage, Published on May 26, 2016, edited on Oct 25, 2016

UVa OJ 10714 – Ants

Browse problem UVa Online Judge. 10714 – Ants. PKU JudgeOnline. No. 1852 – Ants Solution Thinking If all the ants are going to the nearest end of the pole, it is easy to find the earliest time needed. 只要所有的蚂蚁都走到杆的最近端,求出所需的最短时间就很简单。 Find the latest time (找出最长时间) If there are two or more […]