cf219d

树形dp

#include <cstdio>
#include <vector>
using namespace std;

#define D(x) 

const int INF = 0x3f3f3f3f;
const int MAX_N = (int)(2e5) + ;

int n;
vector<pair<int, int> > edge[MAX_N];
int re_num[MAX_N];
vector<int> ans_vec;

int dfs(int father, int u, int add, int re_add)
{
    D(printf("u=%d\n", u));
    int ret = ;
    for (int i = ; i < (int)edge[u].size(); i++)
    {
        int v = edge[u][i].first;
        int w = edge[u][i].second;
        if (v == father)
        {
            continue;
        }
        D(printf("u=%d, v=%d\n", u, v));
        ret += dfs(u, v, add + ( - w), re_add + w) + w;
    }
    re_num[u] = add - re_add;
    D(printf("%d %d\n", u, ret));
    return ret;
}

int main()
{
    scanf("%d", &n);
    for (int i = ; i < n; i++)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        edge[a].push_back(make_pair(b, ));
        edge[b].push_back(make_pair(a, ));
        D(printf("%d %d\n", a, b));
    }
    fill_n(re_num, n + , );
    int ans = dfs(-, , , );
    ans_vec.push_back();
    int root_ans = ans;
    D(printf("%d\n", root_ans));
    for (int i = ; i <= n; i++)
    {
        int temp = re_num[i] + root_ans;
        if (temp == ans)
        {
            ans_vec.push_back(i);
        }
        if (temp < ans)
        {
            ans = temp;
            ans_vec.clear();
            ans_vec.push_back(i);
        }
    }
    printf("%d\n", ans);
    for (int i = ; i < (int)ans_vec.size(); i++)
    {
        printf("%d", ans_vec[i]);
        if (i != (int)ans_vec.size() - )
            putchar(' ');
    }
    puts("");
    return ;
}