牛客（求树的直径）

链接：https://www.nowcoder.com/acm/contest/136/C
来源：牛客网
 

题目描述

    桃花一簇开无主，可爱深红映浅红。

                                        ——《题百叶桃花》

    桃花长在桃树上，树的每个节点有一个桃花，调皮的HtBest想摘尽可能多的桃花。HtBest有一个魔法棒，摘到树上任意一条链上的所有桃花，由于HtBest法力有限，只能使用一次魔法棒，请求出Htbest最多可以摘到多少个桃花。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ff(a,n) for(int i = 0 ; i < n; i++) scanf("%d",a+i)
#define tp(x) printf("x = %d\n",x)
#define ansp(x) printf("%d\n",x)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
//inline ll ask(int x){ll res=0;while(x)res+=c[x],x-=x&(-x);return res;}
//inline void add(int x,int d){while(x<=n)c[x]+=d,x+=x&(-x);}
//int gcd(int a, int b) { return b == 0 ? a : gcd(b, a%b);}
const ll inf = 0x3f3f3f3f;
const int mx = 1e6+10;
int head[mx],tol,n,ind,ans;
bool vis[mx];
struct{
    int to,ne;
}p[mx*2]; 

inline void add(int a, int b){
    //tol++;
    //p[tol].from = a;
    p[tol].to = b;
    p[tol].ne = head[a];
    head[a] = tol++;   
}
void dfs(int x, int now){
    vis[x] = 1;
    if(now > ans){
    	ans =now;
    	ind = x;
	}
    int v;
    for(int i = head[x]; i != -1 ; i = p[i].ne){
        v = p[i].to;
        if(!vis[v])
            dfs(v,now+1);
    }
}

int main(){
	//	freopen("F:\\in.txt","r",stdin);
	//int T=10;	scanf("%d",&T);
	s1(n);
	if(n == 1){
		puts("1");
		return 0;
	}
	int a,b;
	tol = 0;
	mem(head,-1);
	for(int i = 1; i < n; i++){
		s2(a,b);
		add(a,b);
		add(b,a);
	}
	ans = 1;
	vis[1] = 1;
	for(int i = head[1]; i != -1 ; i = p[i].ne){
        int v = p[i].to;
            dfs(v,2);
    }
    mem(vis,0);
    ans = 1;
    vis[ind] = 1;
    for(int i = head[ind]; i != -1 ; i = p[i].ne){
        int v = p[i].to;
            dfs(v,2);
    }
	printf("%d\n",ans);

	return 0;
}