紫书动规 例题9-12 UVA - 12186 Another Crisis 树形dp

题目链接:

https://vjudge.net/problem/UVA-12186

题意:

题解:

d[u]:=让u给上级发信最少需要多少工人。假设u有k个节点，则至少c=(kT-1)/100+1个直接下属发信才行。 把所有子节点的d值从小到大排序，取前c个加起来就是当前的答案。

代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
//
const int maxn = 1e5+10;

int n,T;
vector<int> g[maxn];

int dfs(int u){
    int k = g[u].size();
    if(k == 0) return 1;
    vector<int> d;
    for(int i=0; i<k; i++){
        d.push_back(dfs(g[u][i]));
    }
    sort(d.begin(),d.end());
    int c = (k*T-1)/100 + 1;
    int ans = 0;
    for(int i=0; i<c; i++)
        ans += d[i];
    return ans;
}

int main(){
    while(scanf("%d%d",&n,&T) && (n+T)){
        for(int i=0; i<=n; i++) g[i].clear();
        for(int i=1; i<=n; i++){
            int u = read();
            g[u].push_back(i);
        }
        cout << dfs(0) << endl;
    }

    return 0;
}