1021 Deepest Root

题目描述
知识点：dfs求树的深度。
暴力枚举每个节点为root的最大树高即可。
需要判断下这个图是不是合法树，否则就要输出对应连通图数量。

#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
const int N = 2e5+10;
int n,idx,e[N],h[N],ne[N],level[N],temp_deep;//level暂时保存每个节点的层数
vector<int> res;
void add(int a,int b){
    ne[idx] = h[a],e[idx] = b,h[a] = idx++;
}
void dfs(int root,int u){
    level[root] = u;
    temp_deep = max(level[root],temp_deep);
    for(int i = h[root];i != -1;i = ne[i]){
        int p = e[i];
        if(level[p] == 0)
            dfs(p,u+1);
    }
}
int main(){
    cin>>n;
    memset(h,-1,sizeof h);
    for(int i = 0;i < n-1;i++){
        int a,b;
        cin>>a>>b;
        add(a,b),add(b,a);
    }
    int k = 0;
    for(int i = 1;i <= n;i++){
        if(level[i] == 0){
            k++;
            dfs(i,1);
        }
    }
    if(k > 1){
        cout<<"Error: "<<k<<" components";
        return 0;
    }    
    int max_deep = 0;
    for(int root = 1;root <= n;root++){
        memset(level,0,sizeof level);
        temp_deep = 0;
        dfs(root,1);
        if(temp_deep > max_deep){
            max_deep = temp_deep;
            res.clear();
            res.push_back(root);
        }else if(temp_deep == max_deep){
            res.push_back(root);
        }
    }
    for(int i = 0;i < res.size();i++)cout<<res[i]<<endl;
}

并查集版本
判断是否为一棵树可以用并查集

#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
const int N = 2e5+10;
int n,idx,e[N],h[N],ne[N],level[N],temp_deep;//level暂时保存每个节点的层数
int p[N];
vector<int> res;
int find(int x){
    if(x != p[x]) p[x] = find(p[x]);
    return p[x];
}
void add(int a,int b){
    ne[idx] = h[a],e[idx] = b,h[a] = idx++;
}
void dfs(int root,int u){
    level[root] = u;
    temp_deep = max(level[root],temp_deep);
    for(int i = h[root];i != -1;i = ne[i]){
        int p = e[i];
        if(level[p] == 0)
            dfs(p,u+1);
    }
}
int main(){
    cin>>n;
    memset(h,-1,sizeof h);
    for(int i = 1;i <= n;i++)p[i] = i;
    for(int i = 0;i < n-1;i++){
        int a,b;
        cin>>a>>b;
        add(a,b),add(b,a);
        if(find(a) != find(b))
            p[find(a)] = p[find(b)];
    }
    int k = 0;  
    for(int i = 1;i <= n;i++) if(find(i) == i) k++;
    if(k > 1){
        cout<<"Error: "<<k<<" components";
        return 0;
    }
    int max_deep = 0;
    for(int root = 1;root <= n;root++){
        memset(level,0,sizeof level);
        temp_deep = 0;
        dfs(root,1);
        if(temp_deep > max_deep){
            max_deep = temp_deep;
            res.clear();
            res.push_back(root);
        }else if(temp_deep == max_deep){
            res.push_back(root);
        }
    }
    for(int i = 0;i < res.size();i++)cout<<res[i]<<endl;
}