TLE求调(码风良好)

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define min(a,b) (a>b?b:a)
#define max(a,b) (a>b?a:b)
const int MAX = 3e4+10;
typedef long long ll;
struct Edge{
	ll to,nxt,w;
}edge[MAX];
ll head[MAX],tot;
ll n,q,dp[MAX][110],sum[MAX];
void addedge(ll u,ll v,ll w)
{
	edge[++tot].to=v;
	edge[tot].nxt=head[u];
	edge[tot].w=w;
	head[u]=tot;
}
ll dfs(ll u,ll fa)
{
	
	for(int i=head[u];i!=-1;i=edge[i].nxt)
	{
		//printf("u=%lld fa=%lld\n",u,fa);
		ll v=edge[i].to,w=edge[i].w;
		if(v==fa) continue;
		dfs(v,u);
		sum[u]+=sum[v]+1;
		for(int j=sum[u];j>=0;j--)
			for(int k=0;k<=j-1;k++)
				dp[u][j]=max(dp[u][j],dp[v][k]+dp[u][j-k-1]+w);
	}
}
int main()
{
	memset(head,-1,sizeof(head));
	scanf("%lld %lld",&n,&q);
	for(int i=1;i<n;i++)
	{
		ll u,v,w;
		scanf("%lld %lld %lld",&u,&v,&w);
		addedge(u,v,w);
		addedge(v,u,w);
	}
	dfs(1,0);
	printf("%lld\n",dp[1][q]);
	return 0;
}