专题四--1001
2016-07-06 23:42
302 查看
Problem Description
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
Input
The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j.Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
Output
You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.Sample Input
3 0 990 692 990 0 179 692 179 0 1 1 2
Sample Output
179
题目大意
有N个村庄,用公路连接起来(间接连通也可以)。给出一个矩阵代表两个村庄之间的距离,其中已经有一些村庄连起来了,问最少还要建多长的路才能把所有点连起来;典型的最小生成树的模板题。就不再贴出代码了。来自为知笔记(Wiz)
相关文章推荐
- 西工大空院电子信息工程本科主干课程回顾总结
- TCP和UDP通信
- csr8670--sink工程的大致工作流程分析(以speaker为例)二
- Web 数据实时收集入Hbase ,通过Hive 分析 (JS SDK)
- 微信获取code和openid
- 记一次开发:Qt简单电话本程序
- BZOJ1795 : [Ioi2008]Pyramid Base 金字塔地基
- HTML学习笔记(下)
- HTML学习笔记(下)
- kvm虚拟化安装配置
- Android网络框架源码分析一----Volley
- C程序的坎坷人生
- Ruff 硬件开发初体验
- mysql事件
- Java插入音频文件,导出jar包可播放
- javaScript如何准确地知道属于哪一类对象!!!
- 5.2.6 I/O核心子系统
- 物理学基石 —— 电
- csr8670--sink工程的大致工作流程分析(以speaker为例)一
- Android RxJava详解