Submission #2234867

---

Source Code Expand

#include <iostream>
#include <algorithm>

using namespace std;

long long int min(long long int a, long long int b){
	if (a < b)
		return a;
	else
		return b;
}

long long int max(long long int a, long long int b){
	if (a < b)
		return b;
	else
		return a;
}

int n, m;
long long int mat[301][301];




int main(void){
	cin >> n >> m;

	for (int i = 0; i < 301; i++){
		for (int j = 0; j < 301; j++){
			mat[i][j] = 1000000000000000;
			if (i == j)
				mat[i][j] = 0;
		}
	}

	int a, b, t;
	for (int i = 0; i < m; i++){
		cin >> a >> b >> t;

		mat[a][b] = t;
		mat[b][a] = t;
	}




	for (int k = 1; k <= n; k++){
		for (int i = 1; i <= n; i++){
			for (int j = 1; j <= n; j++){
				mat[i][j] = min(mat[i][j], mat[i][k] + mat[k][j]);
			}
		}
	}

/*	for (int i = 0; i < n+ 1; i++){
		for (int j = 0; j < n + 1; j++)
			cout << mat[i][j] << " ";
		cout << endl;
	}
*/
	long long int m = 1000000000000000;

	for (int i = 1; i <= n; i++){
		int max_t = 0;
		for (int j = 1; j <= n; j++){
			max_t = max(max_t, mat[i][j]);

		}
		m = min(m, max_t);
	}

	cout << m << endl;
}

Submission Info

Judge Result