题目大意:这也是一刀不需要知道题目什么意思的题。只要能看懂样例就行了
解题思路:类似于最大生成树.
1)最大生成树体现在:
bool compare(const edge& a, const edge& b) {
return a.weight > b.weight;
}
2)对于两棵树。如果都有环,不可合并。如果有一个环,标记后合并。如果没有环,直接合并。这主要体现在
if (fx != fy) {//两棵树
if (visited[fx] && visited[fy]) {//都有环
continue;
}
if (visited[fx] || visited[fy]) {//只有一个有环
visited[fx] = visited[fy] = true;
}
//都没有环
sum += e[i].weight;
join(fx, fy);
} else if (!visited[fx]) {//同一棵树,但是没有环(一棵树可以加一个环)
join(fx, fy);
visited[fx] = true;
sum += e[i].weight;
}
代码如下:
/*
* 3367_1.cpp
*
* Created on: 2013年8月27日
* Author: Administrator
*/
#include <iostream>
using namespace std;
struct edge {
int begin;
int end;
int weight;
};
const int maxn = 10050;
int father[maxn];
edge e[maxn * maxn];
bool visited[maxn];
int find(int x) {
if (x == father[x]) {
return x;
}
father[x] = find(father[x]);
return father[x];
}
void join(int x, int y) {
int fx = find(x);
int fy = find(y);
if (fx != fy) {
father[fx] = fy;
}
}
int kruscal(int count) {
int i;
int sum = 0;
for (i = 0; i < maxn; ++i) {
father[i] = i;
}
for (i = 0; i < count; ++i) {
int fx = find(e[i].begin);
int fy = find(e[i].end);
if (fx != fy) {//两棵树
if (visited[fx] && visited[fy]) {//都有环
continue;
}
if (visited[fx] || visited[fy]) {//只有一个有环
visited[fx] = visited[fy] = true;
}
//都没有环
sum += e[i].weight;
join(fx, fy);
} else if (!visited[fx]) {//同一棵树,但是没有环(一棵树可以加一个环)
join(fx, fy);
visited[fx] = true;
sum += e[i].weight;
}
}
return sum;
}
bool compare(const edge& a, const edge& b) {
return a.weight > b.weight;
}
int main() {
int n, m;
while (scanf("%d%d", &n, &m) != EOF, n || m) {
memset(father, 0, sizeof(father));
memset(visited, 0, sizeof(visited));
int i;
for (i = 0; i < m; ++i) {
scanf("%d%d%d", &e[i].begin, &e[i].end, &e[i].weight);
}
sort(e, e + m, compare);
int sum = kruscal(m);
printf("%d\n", sum);
}
}