Codevs 1078 ==Poj 1258 Agri-Net

【Codevs 1078 ==Poj 1258 Agri-Net】的更多相关文章

Codevs 1078 ==Poj 1258 Agri-Net

Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 53270 Accepted: 22140 Description Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. H…

最小生成树 10.1.5.253 1505 poj 1258 http://poj.org/problem?id=1258

#include <iostream>// poj 1258 10.1.5.253 1505 using namespace std; #define N 105 // 顶点的最大个数 (多写 int a[N][N],low[N],n,ans; int min(int x,int y) { return x<y?x:y; } void prim(int u0) { int i,j,m,k; ans=0; // for (i=1;i<n;i++) low[i]=a[u0][i]; /…

poj 1251 poj 1258 hdu 1863 poj 1287 poj 2421 hdu 1233 最小生成树模板题

poj 1251 && hdu 1301 Sample Input 9 //n 结点数A 2 B 12 I 25B 3 C 10 H 40 I 8C 2 D 18 G 55D 1 E 44E 2 F 60 G 38F 0G 1 H 35H 1 I 353A 2 B 10 C 40B 1 C 200Sample Output 21630 prim算法 # include <iostream> # include <cstdio> # include <cstr…

POJ 1258 Agri-Net|| POJ 2485 Highways MST

POJ 1258 Agri-Net http://poj.org/problem?id=1258 水题. 题目就是让你求MST,连矩阵都给你了. prim版 #include<cstdio> const int MAXN=101; const int INF=100000+10; int map[MAXN][MAXN]; int dis[MAXN]; int n; void prim() { bool vis[MAXN]={0}; for(int i=0;i<=n;i++) dis[i]…

POJ 1258

http://poj.org/problem?id=1258 今天晚上随便找了两道题,没想到两道都是我第一次碰到的类型———最小生成树.我以前并没有见过,也不知道怎么做,然后就看书,思路很容易理解但我最开始确想错了,我想成每一个点只可以连接一个或者两个地方,所以那样写出来的答案根本就是错误的,也不是这个树所表达的意思最后多次对书上的算法接合案例一步一步的进行推倒,才发现我的想法是错了,用了一个多小时 #include <stdio.h> #include <string.h>…

poj - 1258 Agri-Net (最小生成树)

http://poj.org/problem?id=1258 FJ为了竞选市长,承诺为这个地区的所有农场联网,为了减少花费,希望所需光纤越少越好,给定每两个农场的花费,求出最小花费. 最小生成树. #include <cstdio> #include <algorithm> using namespace std; ; <<; int cost[maxn][maxn]; int mincost[maxn]; bool used[maxn]; int n; int pri…

POJ 1258 Agri-Net(Prim算法求解MST)

题目链接: http://poj.org/problem?id=1258 Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer John ordered a high speed…