1.链接地址 https://vjudge.net/problem/POJ-1258#author=fuxianda 2.问题描述 有n个农场,已知这n个农场都互相相通,有一定的距离,现在每个农场需要装光纤,问怎么安装光纤能将所有农场都连通起来,并且要使光纤距离最小,输出安装光纤的总距离 任意两个村庄之间的距离小于 100,000. 输入样例 4 0 4 9 21 4 0...
http://poj.org/problem?id=1258 题目: Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 68462 Accepted: 28369 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 yo...
using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 105; int cost[MAXN][MAXN]; int lowcost[MAXN]; int visit[MAXN]; int prim(int n){ memset(visit, 0, sizeof(visit)); for(int i = 1; i <= n; ++i) lowcost[i] = cost[1][i]; visit[1] = 1; lowc...
poj 1258(prim算法)sum与dijksta算法的差别之处returnsum Agri-Net 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....
AgriNet (poj 1258 最短路+prim) -电脑资料 2019-01-01 Language: Agri-NetTime Limit:1000MSMemory Limit:10000KTotal Submissions:40905Accepted:16682 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...
核心:每一步都在连接集合A和A之外的结点的所有边中,选择一条轻量级边加入A,最终A中的边构成一棵最小生成树。因此集合A代表着最小生成树MST(mininum spanning tree)。 #include<bits/stdc++.h>usingnamespacestd;constintINF=0x3f;//无穷大constintN=100;intdis[N];//从MST集合A到A外节点的距离intvis[N]...
include<cstdlib> define N 100 define MAX 10000000 using namespace std;struct Edge { int v1,v2;int l;};Edge e[N*N];int x[N];int cmp(const void *a,const void *b){ return ((Edge*)a)->l-((Edge*)b)->l;} int tou(int n){ if(x[n]==n)return n;return tou(x...
1. #include <stdio.h> #include <string.h> #define inf 0x3fffffff intvisit[101],map[101][101],minpos[101],n; intprim() { intpos,t=0,ant=0,p,min; visit[0]=1; minpos[t++]=0; while(t<n) { min=inf; for(inti=0;i<t;i++) ...
poj 1258 : Agri-Net (prim) 2013-08-15 17:19 −解法一: #include<iostream>using namespace std;int map[102][102];int m=0xfffffff;void prim(int n){ int lowcost[102],s[102]={0},i,j,min,k,ans=0; for(... 单调的幸福
poj_1258 Agri-Net Agri-Net 题目链接:http://poj.org/problem?id=1258 Description Farmer John has been electedmayor of his town! One of his campaign promises was to bring internetconnectivity to all farms in the area. He needs your help, of course....