D. Best Edge Weight
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given a connected weighted graph with n vertices and m edges. The graph doesn't contain loops nor multiple edges. Consider some edge with id i. Let's determine for this edge the maximum integer weight we can give to it so that it is contained in all minimum spanning trees of the graph if we don't change the other weights.