Light OJ 1094 Farthest Nodes in a Tree （树的直径）

1094 - Farthest Nodes in a Tree

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are weighted and undirected. That means you have to find two nodes in the tree whose distance is maximum amongst all nodes.

Input

Input starts with an integer T (≤ 10), denoting the number of test cases.

Each case starts with an integer n (2 ≤ n ≤ 30000) denoting the total number of nodes in the tree. The nodes are numbered from 0 to n-1. Each of the next n-1lines will contain three integers u v w (0 ≤ u, v < n, u ≠ v, 1 ≤ w ≤ 10000) denoting that node u and v are connected by an edge whose weight is w. You can assume that the input will form a valid tree.

Output

For each case, print the case number and the maximum distance.

Sample Input	Output for Sample Input
2 4 0 1 20 1 2 30 2 3 50 5 0 2 20 2 1 10 0 3 29 0 4 50	Case 1: 100 Case 2: 80

Notes

Dataset is huge, use faster i/o methods.

树的直径模板题

从任意一点u出发搜到的最远的点一定是s、t中的一点，然后在从这个最远点开始搜，就可以搜到另一个最长路的端点，即用两遍广搜就可以找出树的最长路 这个链接有它的证明http://www.cnblogs.com/wuyiqi/archive/2012/04/08/2437424.html

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
#define MAX 400010
using namespace std;
int edgesum=0;
int head[MAX*2]; 
int ans;
int T;
int dis[MAX*2];
bool vis[MAX*2];
struct node
{
	int from,to,val,next;
}edge[MAX*2];
void add(int u,int v,int w)//邻接表储存图 
{
	edge[edgesum].from=u;
	edge[edgesum].to=v;
	edge[edgesum].val=w;
	edge[edgesum].next=head[u];
	head[u]=edgesum++;
}
void BFS(int s)
{
	int i;
    queue<int>Q;
	memset(dis,0,sizeof(dis));
	memset(vis,false,sizeof(vis));
	vis[s]=true;
	dis[s]=0;
	Q.push(s);
	ans=0;
	while(!Q.empty())
	{
		int u=Q.front();
		Q.pop();
		for(int i=head[u];i!=-1;i=edge[i].next)
		{
			int v=edge[i].to;
			if(!vis[v])
			{
				if(dis[v]<dis[u]+edge[i].val)
				{
					dis[v]=dis[u]+edge[i].val;
					if(ans<dis[v])
					{
						ans=dis[v];
						T=v;
					}	
				}
				vis[v]=true;
				Q.push(v);
			}
		}
	}
}
int main()
{
	int n,p,a,b,c;
	scanf("%d",&p);
	int l=1;
	while(p--)
	{
	    memset(head,-1,sizeof(head));//初始化头指针为-1，否则将陷入死循环 
		scanf("%d",&n);
		for(int i=1;i<n;i++)
		{
			scanf("%d%d%d",&a,&b,&c);
			add(a,b,c);//建图，因为是无向图，所以要双向见图 
			add(b,a,c);
		}
		BFS(0);//先任意找一点搜索，寻找距离他最远的点 ，即最长路的一个端点 
		BFS(T);//寻找最长路的另一个端点 
		printf("Case %d: %d\n",l++,ans);
	}
	return 0;
}