hdu4003 Find Metal Mineral

#include<iostream>
#include<cstdio>
#include<cstring>
#define M 10010
using namespace std;
struct node{
    int to,val,next;
}edge[M*2];
int head[M],tot;
int dp[M][11],cost[M];
int n,s,k;
void insert(int u,int v,int val){
    edge[tot].to=v;
    edge[tot].val=val;
    edge[tot].next=head[u];
    head[u]=tot++;
}
int init(int u,int pre){
    int i,v,tmp=0;
    for(i=head[u];i!=-1;i=edge[i].next){
        v=edge[i].to;
        if(v==pre) continue;
        tmp+=(init(v,u)+edge[i].val*2);
    }
    cost[u]=tmp;
    return tmp;
}
void dfs(int u,int pre){
    int i,j,l,v;
    for(i=0;i<=k;i++)
        dp[u][i]=cost[u];
    for(i=head[u];i!=-1;i=edge[i].next){
        v=edge[i].to;
        if(v==pre) continue;
        dfs(v,u);
        for(j=k;j>=1;j--)
            for(l=1;l<=j;l++)
                dp[u][j]=min(dp[u][j],dp[u][j-l]+l*edge[i].val+dp[v][l]-cost[v]-2*edge[i].val);
    }
}
int main(){
    int i,j;
    int u,v,val;
    while(scanf("%d%d%d",&n,&s,&k)!=EOF){
        tot=0;
        memset(head,-1,sizeof(head));
        for(i=2;i<=n;i++){
            scanf("%d%d%d",&u,&v,&val);
            insert(u,v,val);
            insert(v,u,val);
        }
        init(s,-1);
        dfs(s,-1);
        printf("%d\n",dp[s][k]);
    }
    return 0;
}

法二

#include<iostream>
#include<cstdio>
#include<cstring>
#define M 10010
using namespace std;
struct node{
    int to,val,next;
}edge[M*2];
int head[M],tot;
int dp[M][11];
int n,s,k;
void insert(int u,int v,int val){
    edge[tot].to=v;
    edge[tot].val=val;
    edge[tot].next=head[u];
    head[u]=tot++;
}
void dfs(int u,int pre){
    int i,j,l,v;
    for(i=head[u];i!=-1;i=edge[i].next){
        v=edge[i].to;
        if(v==pre) continue;
        dfs(v,u);
        for(j=k;j>=0;j--){
            dp[u][j]+=dp[v][0]+2*edge[i].val;
            for(l=1;l<=j;l++)
                dp[u][j]=min(dp[u][j],dp[u][j-l]+dp[v][l]+l*edge[i].val);
        }
    }
}
int main(){
    int i;
    int u,v,val;
    while(scanf("%d%d%d",&n,&s,&k)!=EOF){
        tot=0;
        memset(head,-1,sizeof(head));
        memset(dp,0,sizeof(dp));
        for(i=2;i<=n;i++){
            scanf("%d%d%d",&u,&v,&val);
            insert(u,v,val);
            insert(v,u,val);
        }
        dfs(s,-1);
        printf("%d\n",dp[s][k]);
    }
    return 0;
}