题目:http://hihocoder.com/problemset/solution/1278761
树形DP问题。有取舍所以考虑背包问题。和HDU一题很相似。顺便去做了那题。
#include<bits/stdc++.h>
#define INF 1e18
#define inf 1e9
#define min(a,b) a<b?a:b
#define max(a,b) a>b?a:b
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define IOS ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define N 1025
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
const int _max = 1e2+5;
vector<int> mp[_max];
int p[_max],dp[_max][_max];
int n,m;
bool vis[_max];
void dfs_dp(int i,int j){
if(j >= m) return ;
vis[i] = false;
dp[i][1] = p[i];
for(int t = 0 ; t < mp[i].size() ; t++){
int s = mp[i][t];
if(!vis[s]) continue;
dfs_dp(s,j+1);
for(int v = m ; v >= 2 ; v--){
for(int k = 1 ; k < v ; k++){
dp[i][v] = max(dp[i][v],dp[i][v-k]+dp[s][k]);
}
}
vis[s] = true;
}
}
int main(){
IOS;
int u,v;
while(cin>>n>>m){
memset(dp,0,sizeof(dp));
memset(vis,true,sizeof(vis));
for(int i = 1 ; i <= n ; i++){
mp[i].clear();
cin>>p[i];
}
for(int i = 1 ; i < n ; i++){
cin>>u>>v;
mp[u].push_back(v);
mp[v].push_back(u);
}
dfs_dp(1,0);
cout<<dp[1][m]<<endl;
}
return 0;
}