AcWing 1072. 树的最长路径（两边 dfs）

代码

#include <bits/stdc++.h>
using namespace std;
#define db  double
#define ll  long long
#define Pir pair<int, int>
#define fi  first
#define se  second
#define pb  push_back
#define m_p make_pair
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
/*==========ACMer===========*/
const int N = 1e4 + 10;
vector<Pir> e[N];
int s, dep = -inf;
void dfs(int u, int p, int deep)
{
    if (deep > dep)
    {
        dep = deep;
        s = u;
    }
    for (auto x : e[u]) {
        if (x.fi == p) continue;
        dfs(x.fi, u, deep + x.se);
    }
}





int main()
{
    int n; scanf("%d", &n);
    int u, v, w;
    for (int i = 1; i < n; i ++) {
        scanf("%d %d %d", &u, &v, &w);
        e[u].pb(m_p(v, w));
        e[v].pb(m_p(u, w));
    }

    
    dfs(1, 0, 0);
    dep = -inf;
    dfs(s, 0, 0);
    printf("%d\n", dep);


    return 0;
}