以为树形dp, 其实爆搜

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;
const int N = 110, M = 210;
int h[N], e[M], ne[M], cnt[N], idx;
int ans, n;
void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}
int dfs(int u, int fa, int dist)
{
    int res = 0;
    res = dist * cnt[u];
    for(int i = h[u]; ~ i; i = ne[i])
    {
        int j = e[i];
        if(j == fa) continue;
        //cout << j << endl;
        res = res + dfs(j, u, dist + 1);
    }
    return res;
}
int main()
{
    cin >> n;
    memset(h, -1, sizeof h);
    for(int i = 1; i <= n; i ++)
    {
        int c, l, r;
        cin >> c >> l >> r;
        cnt[i] = c;
        if(l) add(i, l), add(l, i);
        if(r) add(i, r), add(r, i);
    }
    ans = 0x3f3f3f3f;
    for(int i = 1; i <= n; i ++) ans = min(ans, dfs(i, -1, 0));

    cout << ans << endl;
    return 0;
}