| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 3.5 초 | 2048 MB | 14 | 8 | 8 | 57.143% |
You are creating a tour of the Peak District hills for a friend visiting from the Netherlands. The walk will go from the locally famous viewpoint "Hill 1" to the world-famous viewpoint "Hill 2".
To make this friend feel at home, you want to minimise the difference in height between the highest and lowest hills of the walk.
Given a graph of the local points of interest and paths between them, find such an optimally-flat route.
It is guaranteed that there is a path (direct or indirect) between hills $1$ and $2$.
Output the minimum possible distance between the maximum and minimum heights of hills encountered on a walk between hills $1$ and $2$.
5 6 1 2 3 4 5 1 3 1 5 2 4 3 4 4 5 5 2
3
6 6 50 50 5 50 30 70 6 5 3 1 1 6 1 3 5 2 4 2
40