POJ1287——————networking
来源:互联网 发布:java hbase 编辑:程序博客网 时间:2024/05/17 20:34
Description
Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.
Input
The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j i.
Output
Sample Input
1 02 31 2 372 1 171 2 683 71 2 192 3 113 1 71 3 52 3 893 1 911 2 325 71 2 52 3 72 4 84 5 113 5 101 5 64 2 120
很简单的一个最小生成树
克鲁斯卡尔
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<math.h>#define maxn 11000#define oo 0x3f3f3f3fusing namespace std;int father[maxn], n, m;struct node{ int u, v; double w;} s[maxn*100];struct point{ int x, y;} a[maxn];int Find(int x){ while(x!=father[x]) { x=father[x]; } return x;}int cmp(node p, node q){ return p.w<q.w;}int main(){ int u, v, w; while(scanf("%d",&n), n) { scanf("%d", &m); for(int i=1; i<=n; i++) father[i] = i; for(int i=0; i<m; i++) { scanf("%d %d %d", &u, &v, &w); s[i].u = u; s[i].v = v; s[i].w = w; } sort(s, s+m, cmp); int ans = 0; for(int i=0; i<m; i++) { int ru = Find(s[i].u); int rv = Find(s[i].v); if(ru != rv) { father[ru] = rv; ans += s[i].w; } } printf("%d\n", ans); } return 0;}
普利姆
- poj1287——Networking(prim)
- POJ1287——————networking
- POJ1287 Networking
- poj1287 Networking
- POJ1287 Networking
- poj1287 - Networking
- POJ1287-Networking
- poj1287 Networking
- POJ1287 Networking
- Networking||POJ1287
- B - Networking——POJ
- 算法学习【8】——1083. Networking
- 【简记】Computer Networking——Summary
- 【简记】Computer Networking——physical layer
- Computer Networking——Summary QA
- Computer Networking—— physical layer QA
- Computer Networking——network layer QA
- Computer Networking——transport layer QA
- Error:Execution failed for task ':app:mergeDebugResources'. > Some file crunching failed, see logs f
- 软链接的使用
- makefile
- IOS第7天
- svn unversion功能
- POJ1287——————networking
- JVM运行原理
- 百度地图 标注 显示信息 Marker单击事件 代码参考
- Recommender System ——charu C. Aggarwal学习笔记【2】
- 杭电4004The Frog's Games
- 高精度计算(一)概念
- emacs+slime+sbcl搭建common lisp环境
- 【POJ】[2631]Roads in the North
- centos 7修改打开文件数限制