树的直径

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
const int maxn =100020;
using namespace std;
int dis[ maxn ],ans;
bool vis[ maxn ];
vector <pair <int ,int > > V[ maxn ];

int bfs(int x){
    memset (dis ,0, sizeof (dis ));
    memset (vis ,0, sizeof (vis ));
    queue <int >Q;
    Q. push (x); vis[x ]=1;
    int point =0;
    while (!Q. empty ()){
    int F=Q. front ();
    Q.pop ();
    if( dis[F]> ans ){
        ans =dis [F];
        point =F;
    }
    pair <int ,int >t;
    for (int i=0;i<V[F]. size ();i ++){
        t=V[F][i];
        if(vis [t. first ]==0){
        vis [t. first ]=1;
        dis [t. first ]= dis[F]+t. second ;
            Q. push (t. first );
        }
    }
}
 return point ;
}
int main (){
    int x,y,z;
    while (cin >>x>>y>>z){
    V[x]. push_back ( make_pair (y,z));
    V[y]. push_back ( make_pair (x,z));
    }
    ans =0;
    int point =bfs (1);
    ans =0;
    bfs( point );
    cout <<ans << endl ;
    return 0;
}

#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#define maxn 40000+10
#define maxm 80000+10
using namespace std;
int ed, sum;
int dist[maxn], vis[maxn];
int head[maxn], cnt;

struct node {
    int u, v, w, next;
};
node edge[maxm];

void init(){
    cnt = 0;
    memset(head, -1, sizeof(head));
}

void add(int u, int v, int w){
    edge[cnt] = {u, v, w, head[u]};
    head[u] = cnt++;
    edge[cnt] = {v, u, w, head[v]};
    head[v] = cnt++;
}

void bfs(int sx){
    queue<int>q;
    memset(vis, 0, sizeof(vis));
    memset(dist, 0, sizeof(dist));
    ed = sx;
    sum = 0;
    vis[sx] = 1;
    q.push(sx);
    while(!q.empty()){
        int u = q.front();
        q.pop();
        for(int i = head[u]; i != -1; i = edge[i].next){
            int v = edge[i].v;
            if(!vis[v]){
                dist[v] = dist[u] + edge[i].w;
                if(sum < dist[v]){
                    ed = v;
                    sum = dist[v];
                }
                vis[v] = 1;
                q.push(v);
            }
        }
    }
}

int main (){
    int x,y;
    int a, b, c;
    char s;
    init();
    scanf("%d %d",&x,&y);
    while(y--){
        scanf("%d %d %d %c", &a, &b, &c,&s);
        add(a, b, c);

    }
    bfs(1);
    bfs(ed);
    printf("%d\n", sum);
    return 0;
}