題干：

Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <= M <= 20,000) possible connection routes between pairs of barns. Each possible connection route has an associated cost C (1 <= C <= 100,000). Farmer John wants to spend the least amount on connecting the network; he doesn't even want to pay Bessie.?

Realizing Farmer John will not pay her, Bessie decides to do the worst job possible. She must decide on a set of connections to install so that (i) the total cost of these connections is as large as possible, (ii) all the barns are connected together (so that it is possible to reach any barn from any other barn via a path of installed connections), and (iii) so that there are no cycles among the connections (which Farmer John would easily be able to detect). Conditions (ii) and (iii) ensure that the final set of connections will look like a "tree".

Input

* Line 1: Two space-separated integers: N and M?

* Lines 2..M+1: Each line contains three space-separated integers A, B, and C that describe a connection route between barns A and B of cost C.

Output

* Line 1: A single integer, containing the price of the most expensive tree connecting all the barns. If it is not possible to connect all the barns, output -1.

Sample Input

5 8 1 2 3 1 3 7 2 3 10 2 4 4 2 5 8 3 4 6 3 5 2 4 5 17

Sample Output

42

Hint

OUTPUT DETAILS:?

The most expensive tree has cost 17 + 8 + 10 + 7 = 42. It uses the following connections: 4 to 5, 2 to 5, 2 to 3, and 1 to 3.

解題報告：

? ?模板題不解釋了、、（看樣例猜題干系列，，不用讀題都）

AC代碼：

#include<cstdio> #include<iostream> #include<algorithm> #include<queue> #include<map> #include<vector> #include<set> #include<string> #include<cmath> #include<cstring> #define ll long long using namespace std; const int MAX=1e6 + 5; int f[MAX],n,m; struct Edge {int u,v;ll w;Edge(){}Edge(int u,int v,ll w):u(u),v(v),w(w){} } e[MAX]; bool cmp(Edge a,Edge b) {return a.w > b.w; } int getf(int v) {return v == f[v] ? v : f[v] = getf(f[v]); } void merge(int u,int v) {int t1 = getf(u);int t2 = getf(v);if(t1 != t2) f[t2]=t1; } void init(int n) {for(int i = 1; i<=n; i++) f[i] = i; } int main() {ll c;while(~scanf("%d%d",&n,&m)) {init(n);for(int i = 1,a,b; i<=m; i++) {scanf("%d%d%lld",&a,&b,&c);e[i] = Edge(a,b,c); }sort(e+1,e+m+1,cmp);int cnt = 0;ll ans = 0;for(int i= 1; i<=m; i++) {if(getf(e[i].u) == getf(e[i].v)) continue;cnt++;ans += e[i].w;merge(e[i].u,e[i].v);if(cnt == n-1) break;}if(cnt != n-1) printf("-1\n");else printf("%lld\n",ans); }return 0; }

?

總結

以上是生活随笔為你收集整理的【POJ - 2377】Bad Cowtractors （最大生成树，并查集）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。