LP_Cong

解题思路：最短路变形题，求两点之间经过的路的最大值。普通的最短路是求最短的路径的和，因此只要把求和改成求最大即可。详细见代码！

最短路的模板题，以这题为例子，介绍各种最短路算法，和图的各种表示。这里介绍了经典Dijkstra算法和，队列优化的Bell算法，即Spfa算法。Dijkstra算法不能解决负环，而Spfa可以，本例中，spfa返回1代表有负环，0代表没有。算法具体解释参考其他博文

FFF at ValentineProblem DescriptionAt Valentine's eve, Shylock and Lucar were enjoying their time as any other couples. Suddenly, LSH, Boss of FFF Group caught both of them, and locked t

transaction transaction transactionProblem DescriptionKelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens wi

Short Pathtime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputIn my opinion, people are divided into two categories: some