【poj2377】Bad Cowtractors 【USACO 2004 December Silver】
来源:互联网 发布:路由器怎么映射端口 编辑:程序博客网 时间:2024/06/05 05:21
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".
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.
* 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 81 2 31 3 72 3 102 4 42 5 83 4 63 5 24 5 17
Sample Output
42
这道题是最小生成树的变形,求最大生成树,只要将Kruskal的排序改为从大到小排序即可,下面是程序:
#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;struct edge{int u,v,w;bool operator <(edge p)const {return w>p.w;}}a[20005];int f[1005];int findf(int u){return f[u]==u?u:findf(f[u]);}int main(){int n,i,m,s,sum=0;scanf("%d%d",&n,&m);for(i=1;i<=n;i++){f[i]=i;}for(i=1;i<=m;i++){scanf("%d%d%d",&a[i].u,&a[i].v,&a[i].w);}sort(a+1,a+m+1);f[a[1].u]=f[a[1].v]=a[1].u;s=a[1].w;for(i=2;i<=m;i++){int x=findf(a[i].u),y=findf(a[i].v);if(x!=y){f[x]=y;s+=a[i].w;}}for(i=1;i<=n;i++){f[i]=findf(f[i]);}sort(f+1,f+n+1);for(i=1;i<=n;i++){if(f[i]!=f[i-1]){sum++;}}printf("%d\n",sum>1?-1:s);return 0;}注:若图不连通,要输出-1。
阅读全文
0 0
- 【poj2377】Bad Cowtractors 【USACO 2004 December Silver】
- poj2377 - Bad Cowtractors
- POJ2377--Bad Cowtractors
- POJ2377 Bad Cowtractors
- POJ2377-Bad Cowtractors
- POJ2377 Bad Cowtractors
- POJ2377 Bad Cowtractors 最小生成树
- POJ2377 Bad Cowtractors 【最大生成树】
- poj2377 Bad Cowtractors(最小生成树)
- POJ2377 Bad Cowtractors(最大生成树)
- poj2377 Bad Cowtractors (最大生成树)
- [POJ2377]Bad Cowtractors牛的报复
- poj2377 -- Bad Cowtractors(最大生成树)
- POJ2377 Bad Cowtractors【Kruskal】【求最大生成树】
- Usaco 2009 December silver 解题报告
- USACO 2016 December Contest, Silver A
- poj2377 Bad Cowtractors(最大生成树的Prim和Kruskal做法)
- Bad Cowtractors
- JavaScript-正则表达式
- poj2100 -- Graveyard Design(区尺法)
- wireshark过滤规则表达式
- hdu 2097 Sky数
- B
- 【poj2377】Bad Cowtractors 【USACO 2004 December Silver】
- HBase查询优化——持续更新
- 源代码的管理与在eclipse中使用maven进行代码测试
- (1)初涉Mysql
- 管理源代码的工具SVN与GIT
- 关于RxJava
- 使用MyBatis框架,dao层中的类与mapping包中xml配置文件的关系
- 关于js中if语句成立成立条件的总结
- NGUI学习笔记(九):DrawCall优化简单总结