POJ3107 Godfather 树形dp+模拟vector

题意：

Description

Last years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arrest the mafia leaders.

Unfortunately, the structure of Chicago mafia is rather complicated. There are n persons known to be related to mafia. The police have traced their activity for some time, and know that some of them are communicating with each other. Based on the data collected, the chief of the police suggests that the mafia hierarchy can be represented as a tree. The head of the mafia, Godfather, is the root of the tree, and if some person is represented by a node in the tree, its direct subordinates are represented by the children of that node. For the purpose of conspiracy the gangsters only communicate with their direct subordinates and their direct master.

Unfortunately, though the police know gangsters’ communications, they do not know who is a master in any pair of communicating persons. Thus they only have an undirected tree of communications, and do not know who Godfather is.

Based on the idea that Godfather wants to have the most possible control over mafia, the chief of the police has made a suggestion that Godfather is such a person that after deleting it from the communications tree the size of the largest remaining connected component is as small as possible. Help the police to find all potential Godfathers and they will arrest them.

Input

The first line of the input file contains n — the number of persons suspected to belong to mafia (2 ≤ n ≤ 50 000). Let them be numbered from 1 to n.

The following n − 1 lines contain two integer numbers each. The pair ai, bi means that the gangster ai has communicated with the gangster bi. It is guaranteed that the gangsters’ communications form a tree.

Output

Print the numbers of all persons that are suspected to be Godfather. The numbers must be printed in the increasing order, separated by spaces.

Sample Input

6
1 2
2 3
2 5
3 4
3 6

Sample Output

2 3

​ 题目大体意思就是给出一个无向无环图，从中去掉一个结点使其分为一个或多个无向无环图，问去掉哪个结点分成的最大树的结点数最小，把所有符合条件的结点按从小到大的顺序输出出来

思路：

​ 我们可以把无向无环图看作是一棵树，网上说就是求树的所有重心（也就是结点到其它结点的距离和最小）。我的思路也和网上查不多。我们可以强制以1作为根节点，然后由叶到根求每个节点作为根节点的子树的结点和。利用dp【i】存储去掉i结点分成的k颗树的最大结点数，那么dp【i】为i的全部儿子结点为根的子树的最大值与n - (i为根节点的子树结点数)，取两者的较大值即为dp【i】

​ 因为是一遍遍历嘛～复杂度大概为O(n)，用vector存储邻接表2s竟然TLE我的天！！！换成数组模拟vector只有400多ms，再加上快速读模版只耗费了110ms，就酱紫～

代码：

#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#define N 50005
using namespace std;

namespace IO {
    const int MX = 8e5;
    char buf[MX];
    int c, sz;
    void begin() {
        c = 0;
        sz = fread(buf, 1, MX, stdin);
    }
    inline bool read(int &t) {
        while (c < sz && (buf[c] < '0' || buf[c] > '9')) {
            c++;
        }
        if (c >= sz) return false;
        for (t = 0; c < sz && '0' <= buf[c] && buf[c] <= '9'; c++) {
            t = t * 10 + buf[c] - '0';
        }
        return true;
    }
}

int n;
int point[2 * N];
int last[2 * N];
int flag[N];
int num[N];
int dp[N];
int ans[N];

int read() {
    char c = getchar();
    int x = 0;
    while (c < '0' || c > '9') {
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}

void init() {
    int a, b, tot = 0;;
    for (int i = 0; i < n - 1; i++) {
        IO::read(a);
        IO::read(b);
        point[++tot] = b;
        last[tot] = flag[a];
        flag[a] = tot;
        point[++tot] = a;
        last[tot] = flag[b];
        flag[b] = tot;
    }
}

void dfs(int inx, int father) {
    num[inx] = 1;
    for (int i = flag[inx]; i != 0; i = last[i]) {
        int son = point[i];
        if(son == father) continue;
        dfs(son, inx);
        num[inx] += num[son];
        dp[inx] = max(dp[inx], num[son]);
    }
    dp[inx] = max(dp[inx], n - num[inx]);
    return;
}

int main() {
    IO::begin();
    IO::read(n);
    init();
    dfs(1, -1);
    int minn = 0x3f3f3f3f;
    int tot = 0;
    for (int i = 1; i <= n; i++) {
        if(minn > dp[i]) {
            tot = 0;
            ans[tot++] = i;
            minn = dp[i];
        } else if(minn == dp[i]) {
            ans[tot++] = i;
        }
    }
    for (int i = 0; i < tot; i++) {
        if (i == tot - 1) printf("%d\n", ans[i]);
        else printf("%d ", ans[i]);
    }
    return 0;
}

转载请注明出处！！！

如果有写的不对或者不全面的地方 可通过主页的联系方式进行指正，谢谢