PAT甲级1021

solution

#include <iostream>
#include <vector>
#include <set>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 10010;
set<int> s;
vector<int> map[N], v, temp;
int vis[N];
int maxhight = 0;
void dfs(int root, int hight)
{
    vis[root]=true;
    if (hight > maxhight)
    {
        temp.clear();
        temp.push_back(root);
        maxhight = hight;
    }
    else if (hight == maxhight)
    {
        temp.push_back(root);
    }
    for (int i = 0; i <map[root].size(); i++)
    {
        if (!vis[map[root][i]])
            dfs(map[root][i], hight + 1);
    }
}
int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n - 1; i++)
    {
        int a, b;
        cin >> a >> b;
        map[a].push_back(b), map[b].push_back(a);
    }
    int s1 = 0;
    int cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        if (!vis[i])
        {
            dfs(i, 1);
            if (i == 1)
            {
                if (temp.size())
                    s1 = temp[0];
                for (int j = 0; j < temp.size(); j++)
                {
                    s.insert(temp[j]);
                }
            }
            cnt++;
        }
    }
    if (cnt > 1)
    {
        printf("Error: %d components", cnt);
        return 0;
    }
    temp.clear();
    memset(vis, false, sizeof vis);
    dfs(s1, 1);
    for (int j = 0; j < temp.size(); j++)
    {
        s.insert(temp[j]);
    }
    for (auto it = s.begin(); it != s.end(); it++)
    {
        cout << *it << endl;
    }
}