題目鏈接：http://ac.jobdu.com/problem.php?pid=1017

詳解鏈接：https://github.com/zpfbuaa/JobduInCPlusPlus

?

參考代碼：

// // 1017 還是暢通工程.cpp // Jobdu // // Created by PengFei_Zheng on 18/04/2017. // Copyright ? 2017 PengFei_Zheng. All rights reserved. // #include <stdio.h> #include <iostream> #include <algorithm> #include <string.h> #include <cmath> #define MAX_SIZE 110using namespace std;int tree[MAX_SIZE];int findRoot(int x){if(tree[x] == -1) return x;else{int tmp = findRoot(tree[x]);tree[x] = tmp;return tmp;} }struct Edge{int a, b;int cost;bool operator < (const Edge &A) const{return cost < A.cost;}Edge(){a = 0;b = 0;cost = 0;} };int n; int main(){while(scanf("%d",&n)!=EOF && n!=0){Edge edge[n*(n-1)/2+1];for(int i = 1 ; i <= n*(n-1)/2 ; i++){scanf("%d%d%d",&edge[i].a,&edge[i].b,&edge[i].cost);}sort(edge+1, edge+1+n*(n-1)/2);for(int i = 1 ; i <= n ; i++){tree[i] = -1;}int ans = 0;for(int i = 1 ; i <= n*(n-1)/2 ; i++){int a = findRoot(edge[i].a);int b = findRoot(edge[i].b);if(a!=b){tree[a] = b;ans+=edge[i].cost;}}printf("%d\n",ans);}return 0; } /**************************************************************Problem: 1017User: zpfbuaaLanguage: C++Result: AcceptedTime:20 msMemory:1520 kb ****************************************************************/

?

轉(zhuǎn)載于:https://www.cnblogs.com/zpfbuaa/p/6731021.html

總結(jié)

以上是生活随笔為你收集整理的题目1017：还是畅通工程(最小生成树初步应用)的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。