hdu 还是畅通工程

/*

这题就是在1232的基础上加了一个容器

*/

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int ch[102];

struct Line
{
	int s, e;
	int len;
}L;

vector<Line> vec;

int Find(int x)
{
	while(x != ch[x])//一直向上寻找到x=ch[x]
		x = ch[x];
	return x;
}

int cmp(const Line &x, const Line &y) { return x.len < y.len; }

int main()
{
	int n;
	while(scanf("%d", &n) && n)
	{
		int i;
		for( i=0; i <= n; i++ )
			ch[i] = i;
		vec.clear();
		for( i=0; i < n*(n-1)/2; i++ )
		{
			scanf("%d%d%d", &L.s, &L.e, &L.len);
			vec.push_back(L);
		}
		sort(vec.begin(), vec.end(), cmp);
		int sum=0;
		for( i=0; i < vec.size(); i++ )
		{
			L = vec.at(i);
			int x = Find(L.s);
			int y = Find(L.e);
			if(x > y)
				ch[x] = y;//赋值以后ch[x] != x,说明这个点已近链接过了
			else if(x < y)
				ch[y] = x;//同上
			else continue;
			sum += L.len;
		}
		printf("%d\n", sum);
	}
	return 0;
}
/*
4
1 2 3
1 3 1
1 4 4
2 3 5
2 4 2
3 4 4

  */