Submission #202470

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;

class Program {

	public void solve() {
		Scanner cin = new Scanner();
		int N = cin.nextInt();
		int M = cin.nextInt();
		int[][] dist = new int[N][];
		for(int i = 0; i < N; i++) dist[i] = new int[N];

		int INF = (int)1e9;
		for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) {
				if(i == j) dist[i][j] = 0;
				else dist[i][j] = INF;
			}

		for(int i = 0; i < M; i++) {
			int a = cin.nextInt() - 1;
			int b = cin.nextInt() - 1;
			int t = cin.nextInt();
			dist[a][b] = t;
			dist[b][a] = t;
		}

		for(int i = 0; i < N; i++) 
			for(int j = 0; j < N; j++) 
				for(int k = 0; k < N; k++) 
					dist[i][j] = Math.Min(dist[i][j], dist[i][k] + dist[k][j]);

		int[] max = new int[N];
		for(int i = 0; i < N; i++) max[i] = dist[i].Max();
		Console.WriteLine(max.Min());

	}

	#region
	static void Main(string[] args) {
		new Program().solve();
#if DEBUG
		Console.ReadKey(true);
#endif
	}
}
class Scanner {
	string[] s;
	int i;
	char[] cs = new char[] { ' ' };
	public Scanner() {
		s = new string[0];
		i = 0;
	}
	public string next() {
		if(i < s.Length) return s[i++];
		s = Console.ReadLine().Split(cs, StringSplitOptions.RemoveEmptyEntries);
		i = 0;
		return s[i++];
	}
	public int nextInt() { return int.Parse(next()); }
	public long nextLong() { return long.Parse(next()); }
	public double nextDouble() { return double.Parse(next()); }
}
	#endregion

Submission Info

Judge Result