hdu Constructing Roads（最小生成樹，kuskal算法）

Constructing Roads

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14569 Accepted Submission(s): 5530

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

Source kicc
題意： 給出總共的村莊的編號，然後在下面的n行n列中，列舉出來從i節點，到j節點的所有的權值 ，都為最後輸入的那個數，之後在輸入q表示有q組數據，表示接下來的q組數據表示已經聯通，求出最後的最小生成樹的最小權值！ 心得 ： 讀題不慎，讀錯題。白白浪費了兩個小時，都在做這個水題！ 代碼如下：

#include
#include
using namespace std;
struct node{
	int a,b,c;
}s[100100];
int father[110];
int cmp(node x,node y)//求最小生成樹的最小權值，要求權值和最小，故升序。
{
	return x.c=j)//稀疏矩陣的下三角矩陣
				{
					continue;
				}
				s[m].a=i;
				s[m].b=j;
				s[m].c=d;
				m++;//統計位於下三角矩陣的坐標點
			}
		}
		scanf("%d",&q);
		for(i=0;i