CodeForces219D 树形dp

The country Treeland consists of n cities, some pairs of them are connected with unidirectional roads. Overall there are n - 1 roads in the country. We know that if we don’t take the direction of the roads into consideration, we can get from any city to any other one.

The council of the elders has recently decided to choose the capital of Treeland. Of course it should be a city of this country. The council is supposed to meet in the capital and regularly move from the capital to other cities (at this stage nobody is thinking about getting back to the capital from these cities). For that reason if city a is chosen a capital, then all roads must be oriented so that if we move along them, we can get from city a to any other city. For that some roads may have to be inversed.

Help the elders to choose the capital so that they have to inverse the minimum number of roads in the country.

Input

The first input line contains integer n (2 ≤ n ≤ 2·105) — the number of cities in Treeland. Next n - 1 lines contain the descriptions of the roads, one road per line. A road is described by a pair of integers si, ti (1 ≤ si, ti ≤ n; si ≠ ti) — the numbers of cities, connected by that road. The i-th road is oriented from city si to city ti. You can consider cities in Treeland indexed from 1 to n.

Output

In the first line print the minimum number of roads to be inversed if the capital is chosen optimally. In the second line print all possible ways to choose the capital — a sequence of indexes of cities in the increasing order.

Examples：

input

3
2 1
2 3

output

0
2 

input

4
1 4
2 4
3 4

output

2
1 2 3 

​ 这道题翻译成汉语，大概意思就是给出一个有向无环图，问选择哪个节点道路方向反转次数最少且可以到达任意节点。输出最小反转次数和满足条件的全部节点

思路：

​ 由于是有向无环图，我们可以将其转化为树（强制节点1为根节点），我们设正常方向权值为1，反方向权值为0.然后我们第一遍dfs从叶到根遍历每个每个节点作为根节点的子树从根节点到每个节点权值和dp【i】。然后根节点1到所有节点的反转次数为num【1】= n - 1 - dp【i】,第二遍dfs从根到叶求每个节点到全部节点的反转次数即可,利用：

//当从父到子为正向时
num[son.inx] = num[father] + 1;
//当从父到子为反向时
num[son.inx] = num[father] - 1;

代码：

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

struct node {
    int inx, val;
};
vector<node>point[N];
vector<int>ans;
int dp[N];		//
int num[N];

void dfs (int inx, int father) {
    for (int i = 0; i < point[inx].size(); i++) {
        node son = point[inx][i];
        if(son.inx == father) continue;
        dfs(son.inx, inx);
        dp[inx] += son.val + dp[son.inx];
    }
    return;
}

void dfs1 (int inx, int father) {
    for (int i = 0; i < point[inx].size(); i++) {
        node son = point[inx][i];
        if(son.inx == father) continue;
        if(son.val == 1) {
            num[son.inx] = num[inx] + 1;
        } else {
            num[son.inx] = num[inx] - 1;
        }
        dfs1(son.inx, inx);
    }
    return;
}

int main () {
    int n, a, b;
    node c;
    while (scanf("%d", &n) == 1) {
        memset(dp, 0, sizeof(dp));
        memset(num, 0, sizeof(num));
        ans.clear();
        int minn = 0x3f3f3f3f;
        for (int i = 1; i <= n; i++) {
            point[i].clear();
        }
        for (int i = 0; i < n - 1; i++) {
            scanf("%d%d", &a, &b);
            c.inx = b;
            c.val = 1;
            point[a].push_back(c);
            c.inx = a;
            c.val = 0;
            point[b].push_back(c);
        }
        dfs(1, -1);
        num[1] = n - 1 - dp[1];
        dfs1(1, -1);
        for (int i = 1; i <= n; i++) {
            if(minn > num[i]) {
                ans.clear();
                ans.push_back(i);
                minn = num[i];
            } else if(minn == num[i]) {
                ans.push_back(i);
            }
        }
        printf("%d\n", minn);
        for (int i = 0; i < ans.size(); i++) {
            printf("%d%c", ans[i], i == ans.size() - 1? '\n': ' ');
        }
    }
    return 0;
}

转载请注明出处！！！

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