树的直径模板

#include <iostream>
#include <vector>
#include <cstring>

using namespace std;

const int maxn = 10005;
struct D{
    int to,v;
};
vector <D> V[maxn];
int vis[maxn];
int s;

int dfs(int n,int length)
{
    static int dis = length;
    if(length > dis){
        dis = length;
        s = n;
        //cout<<"****"<<s<<"****"<<dis<<endl;
    }
    vis[n] = true;
    int len = V[n].size();
    for(int i=0;i<len;i++){
        if(!vis[ V[n][i].to ]){
            dfs(V[n][i].to , length + V[n][i].v);
            //cout<<length<<"***"<<V[n][i].to<<endl;
        }
    }
    return dis;
}

void print(){
    for(int i=1;i<=6;i++){
        int len = V[i].size();
        for(int j=0;j<len;j++){
            cout<<i<<" to "<<V[i][j].to<<" is "<<V[i][j].v<<endl;
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    int a,b,v;
    while(cin>>a>>b>>v){
        D e1,e2;
        e1.to = b; e2.to = a;
        e1.v = v; e2.v = v;
        V[a].push_back(e1);
        V[b].push_back(e2);
    }
    //print();
    memset(vis,false,sizeof(vis));
    dfs(1,0);
    memset(vis,false,sizeof(vis));
    //cout<<s<<endl;
    cout<< dfs(s,0) <<endl;
    //cout<<s<<endl;
    return 0;
}