Out of Hay

最新推荐文章于 2024-10-06 14:10:45 发布

Shiqux

最新推荐文章于 2024-10-06 14:10:45 发布

阅读量45

点赞数

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/Shiqux/article/details/131869810

版权

文章描述了一种问题，奶牛Bessie需要在多个农场间移动以调查干草情况。有N个农场和M条道路，她要找到最优化的路径以减少携带水的量。问题的核心是找出所有农场间最长的单段路程，确保Bessie能准备足够的水。代码示例提供了一个解决方案，通过并查集来寻找最小生成树并计算最长路径。

摘要由CSDN通过智能技术生成

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.

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.

Output

* Line 1: A single integer that is the length of the longest road required to be traversed.

input

3 3
1 2 23
2 3 1000
1 3 43

output

代码

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,sum=0;
#define ll long long 
const ll N=100005;
ll f[N];
struct node
{
	int u,v,w;
 } a[N];
 bool cmp(node x,node y)
 {
 	return x.w<y.w;
 }
ll find(ll x)
 {
 	if(x==f[x]) return x;
 	else return f[x]=find(f[x]);
 }
void init()
 {
 	for(int i=0;i<=n;i++)
 	f[i]=i;
 }
int main()
{
	while(cin>>n)
	{
		init();
		scanf("%d",&m);
		for(int i=0;i<m;i++)
		cin>>a[i].u>>a[i].v>>a[i].w;
		sort(a,a+m,cmp);
		for(int i=0;i<m;i++)
		{
			int x=find(a[i].u);
			int y=find(a[i].v );
			int z=a[i].w;
			if(x!=y)
			{
				sum=max(sum,z);
				f[x]=y;
			}
		}
		cout<<sum<<endl;
		
	}
	cout<<endl;
	return 0;
}