图知识小结5-kruskal算法的数组模拟实现与应用

#include <bits/stdc++.h>
using namespace std;
const int MAX_EDGE = 100000;
const int MAX_VERTICES = 100;
struct Edge{
	int len, u, v;
} edge[MAX_VERTICES];
int fa[MAX_VERTICES], nv, ne;
bool cmp(Edge a, Edge b){
	return a.len < b.len;
}
int get_ancestor(int x){
	if(fa[x] == x){
		return fa[x];
	}
	return fa[x] = get_ancestor(fa[x]);
}
bool merge(int x, int y){
	int ance_x = get_ancestor(x);
	int ance_y = get_ancestor(y);
	if(ance_x != ance_y){
		fa[ance_x] = ance_y;
		return true;
	}
	return false;
}
void init(){
	for(int i = 0 ; i <= nv ; i++){
		fa[i] = i;
	}
}
int main(){
	cin >> nv >> ne;
	init();
	for(int i = 1 ; i <= ne ; i++){
		cin >> 	edge[i].u >> edge[i].v >> edge[i].len;
	}
	sort(edge + 1, edge + ne + 1, cmp); //abandon the first space in edge array 
	int rest_vertices = nv, weight_sum = 0, sub_cost = -1; //weight_sum : weight on MST, sub_cost : the maximum edge's weight in MST
	for(int i = 1 ; i <= ne && rest_vertices > 1 ; i++){ // the last situation will be rest_vertices == 1 cause there is just one nodes left
		if(merge(edge[i].u, edge[i].v)){
			weight_sum += edge[i].len;
			rest_vertices--;
			if(edge[i].len > sub_cost){
				sub_cost = edge[i].len;
			}
		} 
	}
	cout << "Minimum cost : " << weight_sum << endl;
	cout << "The maximum edge's weight in MST : " << sub_cost << endl;
	return 0;
}

上面的代码可以直接用到CCF 201703-4地铁修建，需要改一下参数和去掉输出提示，代码如下：

 

#include <bits/stdc++.h>
using namespace std;
const int MAX_EDGE =  200050;
const int MAX_VERTICES = 100050;
struct Edge{
	int len, u, v;
} edge[MAX_EDGE];
int fa[MAX_VERTICES], nv, ne;
bool cmp(Edge a, Edge b){
	return a.len < b.len;
}
int get_ancestor(int x){
	if(fa[x] == x){
		return fa[x];
	}
	return fa[x] = get_ancestor(fa[x]);
}
bool same(int x, int y){
	return get_ancestor(x) == get_ancestor(y);
} 
bool merge(int x, int y){
	int ance_x = get_ancestor(x);
	int ance_y = get_ancestor(y);
	if(ance_x != ance_y){
		fa[ance_x] = ance_y;
		return true;
	}
	return false;
}
int main(){
	cin >> nv >> ne;
	for(int i =  1 ; i <= nv ; i++){
		fa[i] = i;
	}
	int sub_cost = 0;
	for(int i = 1 ; i <= ne ; i++){
		cin >> 	edge[i].u >> edge[i].v >> edge[i].len;
		if(edge[i].u == 1 && edge[i].v == nv || edge[i].u == nv && edge[i].v == 1){
			sub_cost = edge[i].len;
		}
	}
	sort(edge + 1, edge + ne + 1, cmp); //abandon the first space in edge array 
	int rest_vertices = nv, weight_sum = 0; //weight_sum : weight on MST, sub_cost : the maximum edge's weight in MST
	for(int i = 1 ; i <= ne && rest_vertices > 1 ; i++){ // the last situation will be rest_vertices == 1 cause there is just one nodes left
		if(same(1,nv)){	
			break;
		}
		else if(merge(edge[i].u, edge[i].v)){
			weight_sum += edge[i].len;
			rest_vertices--;
			sub_cost = edge[i].len;
		} 
	}
	cout << sub_cost;
	return 0;
}
//此题使用最小生成树的思路去做并没有问题，但并不是要得到最小生成树
//而是找到连通起点和最终点之之间的最小路径中的最大边 

遗憾的是，用克鲁斯卡写出来也是80分，目前还没有解决

2018/12/9解决掉了，这个是因为边集数组开小了，因为开始边集数组大小误开成了edge[MAX_VERTICES]，改成edge[MAX_EDGE]之后再提交就是100分了