这是一道来自东北大学在线评测系统（OJ）的题目，要求利用Prim算法找出连接所有需要清扫的雪地点的最短路径长度。题目描述中提到，由于大雪过后，学校需要清扫出一条连通的道路，而清扫的长度需要最小化。输入包含多组数据，每组数据给出需要清扫的点的坐标，输出为最短路径的长度（保留一位小数）。
1222: Sweep the snow
时间限制: 1 Sec 内存限制: 128 MB提交: 28 解决: 18
[ 提交][ 状态][ 讨论版]
题目描述
After the big big snow yesterday, NEU became a beautiful silver world.In the morning, poor michaelalan got a short message which told him to sweep the whole school snow and make the traffic unblocked. As you see, it needs so much time to do by one person.There are some points need clear,and these points must connected together(eg:If there are A point and B point, then sweep a line between A and B is enough). So he wants to know the minimum length of snow he need
最低0.47元/天 解锁文章
扫一扫
1108
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
