【BZOJ】1682: [Usaco2005 Mar]Out of Hay 干草危机（kruskal）

最新推荐文章于 2024-10-07 00:33:53 发布

转载最新推荐文章于 2024-10-07 00:33:53 发布 · 353 阅读

1 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/iwtwiioi/p/3957862.html

文章标签：

#php

本文深入探讨了最小生成树算法的实现，通过具体题目解析，展示了如何使用C++编程语言来解决最小生成树问题。文章提供了完整的代码示例，解释了关键步骤，如边的比较、并查集操作和路径压缩技巧。

http://www.lydsy.com/JudgeOnline/problem.php?id=1682

最小生成树裸题。。

#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define for1(i,a,n) for(int i=(a);i<=(n);++i)
#define for2(i,a,n) for(int i=(a);i<(n);++i)
#define for3(i,a,n) for(int i=(a);i>=(n);--i)
#define for4(i,a,n) for(int i=(a);i>(n);--i)
#define CC(i,a) memset(i,a,sizeof(i))
#define read(a) a=getint()
#define print(a) printf("%d", a)
#define dbg(x) cout << #x << " = " << x << endl
#define printarr(a, n, m) rep(aaa, n) { rep(bbb, m) cout << a[aaa][bbb]; cout << endl; }
inline const int getint() { int r=0, k=1; char c=getchar(); for(; c<'0'||c>'9'; c=getchar()) if(c=='-') k=-1; for(; c>='0'&&c<='9'; c=getchar()) r=r*10+c-'0'; return k*r; }
inline const int max(const int &a, const int &b) { return a>b?a:b; }
inline const int min(const int &a, const int &b) { return a<b?a:b; }

const int N=2005, M=10005;
struct EDGE { int x, y, w; }e[M];
int p[N], n, m;
bool cmp(const EDGE &a, const EDGE &b) { return a.w<b.w; }
int ifind(int x) { return x==p[x]?x:p[x]=ifind(p[x]); }
int main() {
	read(n); read(m);
	for1(i, 1, m) e[i].x=getint(), e[i].y=getint(), e[i].w=getint();
	for1(i, 1, n) p[i]=i;
	sort(e+1, e+1+m, cmp);
	int ans=0;
	for1(i, 1, m) {
		int fx=ifind(e[i].x), fy=ifind(e[i].y);
		if(fx!=fy) {
			p[fx]=fy;
			ans=max(ans, e[i].w);
		}
	}
	print(ans);
	return 0;
}

Description

The cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) farms (numbered 1..N); Bessie starts at Farm 1. She'll traverse some or all of the M (1 <= M <= 10,000) two-way roads whose length does not exceed 1,000,000,000 that connect the farms. Some farms may be multiply connected with different length roads. All farms are connected one way or another to Farm 1. Bessie is trying to decide how large a waterskin she will need. She knows that she needs one ounce of water for each unit of length of a road. Since she can get more water at each farm, she's only concerned about the length of the longest road. Of course, she plans her route between farms such that she minimizes the amount of water she must carry. Help Bessie know the largest amount of water she will ever have to carry: what is the length of longest road she'll have to travel between any two farms, presuming she chooses routes that minimize that number? This means, of course, that she might backtrack over a road in order to minimize the length of the longest road she'll have to traverse.

牛们干草要用完了！贝茜打算去勘查灾情．

有N(2≤N≤2000)个农场，M(≤M≤10000)条双向道路连接着它们，长度不超过109．每一个农场均与农场1连通．贝茜要走遍每一个农场．她每走一单位长的路，就要消耗一单位的水．从一个农场走到另一个农场，她就要带上数量上等于路长的水．请帮她确定最小的水箱容量．也就是说，确定某一种方案，使走遍所有农场通过的最长道路的长度最小，必要时她可以走回头路．

Input

* Line 1: Two space-separated integers, N and M. * Lines 2..1+M: Line i+1 contains three space-separated integers, A_i, B_i, and L_i, describing a road from A_i to B_i of length L_i.

第1行输入两个整数N和M;接下来M行，每行输入三个整数，表示一条道路的起点终点和长度．