poj2377解题报告
来源:互联网 发布:windows loader百度云 编辑:程序博客网 时间:2024/06/15 00:50
Bad Cowtractors
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6456 Accepted: 2816
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
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.
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.
题目大意:求一最大生成树
思路:这个题让我快崩溃了,WA了很多次,最后看discuss说有重边。。。改完AC了 疯了。。。
- poj2377解题报告
- poj2377解题报告
- POJ2377 解题报告
- poj2377
- poj2377
- POJ2377
- poj2377
- poj2377
- poj2377
- poj2377
- 解题报告
- 解题报告
- 解题报告
- 解题报告
- 解题报告
- 解题报告
- 解题报告
- poj2377 kruskal
- typedef与前置声明
- 从excel表导入sql server2000数据库
- ADMEMS 软件设计架构方法
- C++ WMI 修改PC ip地址,子网掩码,网关
- 字符编码
- poj2377解题报告
- 如何修改oracle数据库的用户连接数
- Eclipse常用快捷键
- 【jsp/servlet】java.lang.ClassCastException: java.lang.Integer
- 常用SQL
- c#操作xml(2)
- DB2数据库发生死锁了怎么办
- 将数据库种某个字段值种的某写字符替换掉
- 基于Android Bionic 库动态编译busybox