poj 2631 Roads in the North

题目：Roads in the North

思路：求树的直径的模板题，两次bfs。

代码：

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <cstring>
#include <map>
#include <cmath>
using namespace std;

#define maxn 10000

struct Pair {
	int x,y;
	Pair(int xx=0,int yy=0){x=xx,y=yy;}
};

int n;

vector<Pair> a[maxn+5];

void readin(){
	map<int,int> mp;
	n=0;
	
	int x,y,z;
	while(~scanf("%d%d%d",&x,&y,&z)){
		if(!mp.count(x)) mp[x]=++n;
		if(!mp.count(y)) mp[y]=++n;
		x=mp[x],y=mp[y];
		a[x].push_back(Pair(y,z)),a[y].push_back(Pair(x,z));
	}
}

int b[maxn+5]={0};
int stp;

int dfs(int x,int s){
	b[x]=s;
	int d=0,c=x;
	for(int i=0;i<a[x].size();i++){
		if(b[a[x][i].x]) continue;
		int y=dfs(a[x][i].x,s+a[x][i].y);
		if(b[y]>d){
			d=b[y],c=y;
		}
	}
	stp=max(stp,d);
	return c;
}

int srch(int x,int y){
	memset(b,0,sizeof(b));
	stp=0;
	int s=dfs(x,0);
	if(y) return stp;
	return s;
}

int main() {
	readin();
	printf("%d",srch(srch(1,0),1));
	return 0;
}