Bad Cowtractors(Kruskal)
来源:互联网 发布:淘宝联盟怎么合并购买 编辑:程序博客网 时间:2024/06/10 03:15
Bad Cowtractors
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 16242 Accepted: 6631
Description
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.
OutputLine 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.
Source
USACO 2004 December Silver
最小生成树,找最大的,排序按照从大到小排~
#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>using namespace std;int pre[212109];struct node{ int x, y, data;}t[21211];bool cmp(struct node a, struct node b)//快排{ return a.data>b.data;}int root(int a)//寻找根节点{ while(a!=pre[a]) { a = pre[a]; } return a;}void kruskal(int n, int m){ int ans = 0, sum = 0; for(int i=0;i<m;i++) { int x = root(t[i].x); int y = root(t[i].y); if(x!=y) { ans += t[i].data; pre[y] =x; sum += 1; if(sum==n-1)//记录连接的条数 break; } } if(sum==n-1) cout<<ans<<endl; else cout<<-1<<endl;}int main(){ int n, m; while(~scanf("%d %d", &n, &m)) { for(int i = 0;i<=n;i++)//初始化 pre[i] = i; for(int i=0;i<m;i++) { scanf("%d %d %d", &t[i].x, &t[i].y, &t[i].data); } sort(t, t+m, cmp); kruskal(n, m); } return 0;}
- Bad Cowtractors (Kruskal)
- Bad Cowtractors(Kruskal)
- POJ 2377 Bad Cowtractors(Kruskal算法)
- poj Bad 2377 Cowtractors prim,kruskal
- POJ - 2377 Bad Cowtractors (最大生成树,Kruskal)
- POJ2377 Bad Cowtractors【Kruskal】【求最大生成树】
- POJ 2377 Bad Cowtractors(Kruskal求最大生成树)
- POJ 2377 Bad Cowtractors (kruskal求MST)
- POJ 2377Bad Cowtractors(kruskal最大生成树)
- POJ 2377 Bad Cowtractors 最小生成树 Kruskal
- HDU 2377 Bad Cowtractors(最大生成树-Kruskal)
- Bad Cowtractors(求最大生成树 Kruskal变形)
- poj-2377-Bad Cowtractors--(最小生成树Kruskal)
- Bad Cowtractors
- Bad Cowtractors
- Bad Cowtractors
- Bad Cowtractors
- Bad Cowtractors
- 【新手指南】如何使用手机通过wifi直接连接打印机并打印
- SVN 版本管理系统的安装
- cocos2d-x 源码分析 之 CCTableView源码分析(附使用方法讨论)
- 《程序员的修炼之道》笔记——2、软件的熵
- muduo源码学习(8)-ThreadPool
- Bad Cowtractors(Kruskal)
- 最大值减去最小值小于等于num的子数组数量
- 浮点数陷阱
- filter详解
- Rhino| Rhino详细介绍与实战
- maven 中的快照版本的讲解(SNAPSHOT)
- Java实现汉诺塔 -- JAVA 算法学习
- elasticsearch之Document APIs【Reindex API】
- su、sudo、sudo su、sudo -i的用法和区别