最小生成树
Grit_ICPC
Dielts
展开
-
Truck History Poj 1789(Prim)
Truck HistoryTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 21311 Accepted: 8277DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types.原创 2015-08-03 14:40:46 · 407 阅读 · 0 评论 -
Highways Poj
HighwaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24872 Accepted: 11468DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Fl原创 2015-08-03 16:32:01 · 426 阅读 · 0 评论 -
Poj1258 Agri-Net (Prim)
Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 44981 Accepted: 18449DescriptionFarmer John has been elected mayor of his town! One of his campaig原创 2015-08-04 09:15:45 · 458 阅读 · 0 评论 -
POJ 2377 Bad Cowtractors(最大生成树)
题目大意:裸的最大生成树思路:就是和最小生成树相似,Map数组初始化为0,并且在建立生成树的时候要选去最大的边进入集合。#include#include#include#include#define inf 0x3f3f3f3fusing namespace std;int n;int Map[1010][1010],dis[1010];bool vis[1原创 2015-09-29 17:41:41 · 462 阅读 · 0 评论 -
HDOJ 1102 prim
Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17875 Accepted Submission(s): 6799Problem DescriptionThere are N vill原创 2015-09-23 16:11:12 · 450 阅读 · 0 评论 -
POJ Building a Space Station 2031 (最小生成树+三维空间)
大意:在空间中给定球的坐标,和棋半径,问所以球之间都可达并且权值和最小(球之间有重合的部分)。思路:直接最小生成树。#include<map>#include<queue>#include<cmath>#include<cstdio>#include<stack>#include<iostream>#include<cstring>#include<algorithm>#define原创 2016-03-29 11:01:45 · 455 阅读 · 0 评论 -
HDU 3367 Pseudoforest(最大生成树+并查集)
大意:n个点m条边,问如果每个联通分支中最多有一个环,最后可以组成的最大的权值和是多少。思路:类似一颗生成树,是的话那么一定是最大生成树。那么怎么判断是不是会有环的形成呢?那么就可以用并查集判断了,所以直接用克鲁斯卡尔算法算最大生成树即可。概括起来有两种情况:1、两个端点在同一集合,那么判断是不是有环(标记数组判定),2.不在同一集合,如果两边都有环也不可以。#include<map>#inclu原创 2016-04-15 20:14:23 · 439 阅读 · 0 评论 -
最小生成树计数 bzoj 1016
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define mod 31011using namespace std;int n,m,cnt,tot,ans=1,sum;int fa[105];struct edge{int x,y,v;}e[1005];struct data{int原创 2016-04-24 16:39:06 · 420 阅读 · 0 评论