Roads in the North（树的直径）（暂存）

最新推荐文章于 2019-08-27 16:52:29 发布

双木林233

最新推荐文章于 2019-08-27 16:52:29 发布

阅读量88

点赞数

分类专栏：未解

本文链接：https://blog.csdn.net/qq_43470233/article/details/97299079

版权

未解专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Roads in the North

Building and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that there is only one route from a village to a village that does not pass through some other village twice.
Given is an area in the far North comprising a number of villages and roads among them such that any village can be reached by road from any other village. Your job is to find the road distance between the two most remote villages in the area.

The area has up to 10,000 villages connected by road segments. The villages are numbered from 1.
Input
Input to the problem is a sequence of lines, each containing three positive integers: the number of a village, the number of a different village, and the length of the road segment connecting the villages in kilometers. All road segments are two-way.
Output
You are to output a single integer: the road distance between the two most remote villages in the area.
Sample Input
5 1 6
1 4 5
6 3 9
2 6 8
6 1 7
Sample Output
22

这道题很奇怪的地方在于多组输入，（大佬说需要Ctrl+z然后怎么怎么着来结束。。。没听懂，所以样例还没运行出来，不过bfs应该是对的）

#include<iostream>
#include<algorithm>
#include<string.h>
#include<queue>
using namespace std;

int n,m;//n是农场数，m是路的个数
int a,b,cost;//两个农场的位置以及距离（存的时候两个方向都要存）
char d;
int dis[50005];//到每个农场的距离 
int vis[50005]; 
int ed,ans,num;
int head[50005];
struct cow{
	int from;//农场的序号1
	int to;//农场的序号2 
	int next;
	int llng;//距离 
	//friend bool operator<(cow a,cow b){
	//	return a.llng <b.llng ;
	//} 
};
cow e1[100005];
void add(int a,int b,int c){
	e1[num].from =a;
	e1[num].to =b;
	e1[num].llng =c;
	e1[num].next =head[a];
	head[a]=num++;
}
void bfs(int x){
	memset(vis,0,sizeof(vis));
	memset(dis,0,sizeof(dis));
	queue<int> que;
	que.push(x);
	vis[x]=1;
	ans=0;
	while(!que.empty()){
		int u,v,i;
		u=que.front();
		//cout<<"u:"<<u<<endl;
		que.pop();
		for(i=head[u];i!=-1;i=e1[i].next ){
		v=e1[i].to ;
		//cout<<"v:"<<v<<endl; 
		if(!vis[v]){
			
			if(dis[v]<dis[u]+e1[i].llng )
				dis[v]=dis[u]+e1[i].llng;
				vis[v]=1;
				que.push(v);
		//		cout<<"v:::::"<<v<<endl;
			}
		}
	} 
	for(int i=1;i<=n;i++){
	if(dis[i] >ans){
			ans=dis[i];
			ed=i;
		//	cout<<"ans:"<<ans<<" "<<i<<endl;
			}
		} 
	} 

int main(){
	ios::sync_with_stdio(0);
	cin.tie(),cout.tie();
	
	int num=1;
	memset(head,-1,sizeof(head));
	
		while(scanf("%d %d %d",&a,&b,&cost)!=EOF){
			add(a,b,cost);
		add(b,a,cost);
		}
		bfs(1);
	
	bfs(ed);
	cout<<ans<<endl;

	
	
	
	return 0;
}

/*

1 6 13
6 3 9
3 5 7
4 1 3
2 4 20
4 7 2
7 6 67
7 5 76


*/