很容易发现这样一个性质:
对于一个点x,若他产生了贡献,一定是在选他所有儿子中能获得总价值最大的那个儿子时,产生贡献,
那么先一遍dfs考虑每个点x对于哪个儿子产生贡献
然后再一遍dfs求出到每个叶子节点能产生的贡献,
排序后取后k个数即可
c++代码如下:
#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x ;i <= y;++ i)
#define repd(i,x,y) for(register int i = x ;i >= y;-- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
x = 0;char c;int sign = 1;
do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
x *= sign;
}
const int N = 2e5+500;
int n,k,hson[N],cnt;ll ans,w[N],f[N],val[N];
int nxt[N],head[N],to[N],tot;
inline void add(int x,int y)
{
nxt[tot] = head[x];
to[tot] = y;
head[x] = tot ++;
}
void dfs1(int x)
{
f[x] = val[x];
for(register int i = head[x];~i;i = nxt[i])
{
dfs1(to[i]);
if(f[hson[x]] < f[to[i]])
hson[x] = to[i];
}
f[x] += f[hson[x]];
}
void dfs2(int x)
{
if(head[x] == -1) w[++cnt] = f[x] + val[x];
f[hson[x]] += f[x] + val[x];
for(register int i = head[x];~i;i = nxt[i])
dfs2(to[i]);
}
int main()
{
memset(head,-1,sizeof head);
read(n); read(k);
rep(i,1,n) read(val[i]);
rep(i,2,n)
{
int u,v;
read(u); read(v);
add(u,v);
}
dfs1(1);
memset(f,0,sizeof f);
dfs2(1);
sort(w + 1,w + 1 + cnt);
repd(i,cnt,max(1,cnt - k + 1)) ans += w[i];
cout << ans << endl;
return 0;
}