HDU 4118 && ZOJ 3659

两道有趣的树上乱搞题

HDU 4118

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 100100
using namespace std;
struct Edge{
    int v,c,next;
}edge[N*2];
int head[N],num[N],cnt,n;
long long sum;
bool vis[N];
void addedge(int u,int v,int c){
    edge[cnt].v=v;
    edge[cnt].c=c;
    edge[cnt].next=head[u];
    head[u]=cnt++;

    edge[cnt].v=u;
    edge[cnt].c=c;
    edge[cnt].next=head[v];
    head[v]=cnt++;
}
void init(){
    cnt=sum=0;
    memset(head,-1,sizeof(head));
    memset(num,0,sizeof(num));
    memset(vis,0,sizeof(vis));
}
void dfs(int u){
    int i;
    num[u]=1;
    vis[u]=1;
    for(i=head[u];i!=-1;i=edge[i].next){
        int v=edge[i].v;
        if(vis[v])continue;
        dfs(v);
        num[u]+=num[v];
        sum+=min(num[v],n-num[v])*edge[i].c;
    }
}
int main(){
    int t,T,u,v,c,i;
    scanf("%d",&T);
    for(t=1;t<=T;t++){
        scanf("%d",&n);
        init();
        for(i=1;i<n;i++){
            scanf("%d %d %d",&u,&v,&c);
            addedge(u,v,c);
        }
        dfs(1);
        printf("Case #%d: %lld\n",t,sum*2);
    }
}

ZOJ 3659

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 200100
using namespace std;
struct Edge{
    int u,v,w;
}edge[N];
int f[N],num[N];
long long cost[N];
int find(int u){
    if(f[u]==u)return u;
    return f[u]=find(f[u]);
}
bool cmp(struct Edge a,struct Edge b){
    return a.w>b.w;
}
int main(){
    int n,i;
    while(scanf("%d",&n)==1){
        for(i=1;i<n;i++)
            scanf("%d %d %d",&edge[i].u,&edge[i].v,&edge[i].w);
        sort(edge+1,edge+n,cmp);
        for(i=1;i<=n;i++)f[i]=i,num[i]=1,cost[i]=0;
        for(i=1;i<n;i++){
            int uu=find(edge[i].u);
            int vv=find(edge[i].v);
            if(uu!=vv){
                cost[vv]=max((long long)num[uu]*edge[i].w+cost[vv],(long long)num[vv]*edge[i].w+cost[uu]);
                num[vv]+=num[uu];
                f[uu]=vv;
            }
        }
        printf("%lld\n",cost[find(1)]);
    }
}