1021 Deepest Root (25 分)

知识点：图的dfs

一开始这道题写错了不知道为题出在哪里，后来发现了，是邻接表的两个数组开小了，这两个数组大小是由边的个数决定的，而不是点的个数，这个要想明白，然后就是本题的做法了，先判断是不是一个连通块，然后就是暴力dfs，求以每一个顶点的为根的树的最大深度，最后统计答案输出即可

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(x) ((int) x.size())
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

const int N = 1e4 + 5;

int tot, cnt, tmp;
int head[N], ver[N * 10], Next[N * 10], rec[N], vis[N];

void add(int x, int y) {
    ver[++tot] = y;
    Next[tot] = head[x]; head[x] = tot;
}

void dfs(int v, int depth) {
    vis[v] = 1; tmp = max(tmp, depth);
    for (int i = head[v]; i; i = Next[i]) {
        if (!vis[ver[i]]) dfs(ver[i], depth + 1);
    }
}

int main() {
    int n; cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int a, b; scanf("%d %d", &a, &b);
        add(a, b); add(b, a);
    }
    for (int i = 1; i <= n; i++) {
        if (!vis[i]) { cnt++; dfs(i, 0); }
    }
    if (cnt > 1) cout << "Error: " << cnt << " components";
    else {
        for (int i = 1; i <= n; i++) {
            memset(vis, 0, sizeof(vis));
            tmp = 0; dfs(i, 0); rec[i] = tmp;
        }
        int Max = 0;
        for (int i = 1; i <= n; i++) if (rec[i] > Max) Max = rec[i];
        for (int i = 1; i <= n; i++) if (rec[i] == Max) cout << i << endl;
    }
    return 0;
}