poj 1655(树形DP 求解重心)

不明白树的重心的先移步树的重心

然后 。。就没然后了。。常规做法， 最后输出数的重心所在的结点和把这个结点删除后剩下连通图的最大结点数。

/***********************************************
 * Author: fisty
 * Created Time: 2015/2/22 18:24:00
 * File Name   : poj1655.cpp
 *********************************************** */
#include <iostream>
#include <cstring>
#include <deque>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <algorithm>
using namespace std;
#define Debug(x) cout << #x << " " << x <<endl
#define Memset(x, a) memset(x, a, sizeof(x))
const int INF = 0x3f3f3f3f;
typedef long long LL;
typedef pair<int, int> P;
#define FOR(i, a, b) for(int i = a;i < b; i++)
#define MAX_N 51000
int t;
int n;
int result;
vector <int> G[MAX_N];
int dp[MAX_N], f[MAX_N];
void dfs(int u, int fa){
    f[u] = 1;
    int _max = 0;
    for(int i = 0;i < G[u].size(); i++){
        int v = G[u][i];
        if(v == fa) continue;
        dfs(v, u);
        f[u] += f[v];
        _max = max(_max, f[v]);
    }
    dp[u] = max(_max, n - f[u]);
    result = min(dp[u], result);
}
int main() {
    //freopen("in.cpp", "r", stdin);
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> t;
    while(t--){
        result = INF;
        Memset(dp, 0);
        Memset(f, 0);
        cin >> n;
        FOR(i, 0, n+1){
            G[i].clear();
        }
        FOR(i, 0, n-1){
            int u,  v;
            cin >> u >> v;
            G[u].push_back(v);
            G[v].push_back(u);
        }
        dfs(1, -1);
        for(int i = 1;i <= n; i++){
            if(dp[i] == result){
                cout << i << " " << result << endl;
            }
        }
    }
    return 0;
}