hdu4424 并查集

思维题 代码很好写 并查集不好想啊啊啊啊啊啊啊啊啊

ACcode：

#include<set>
#include<map>
#include<cmath>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;

const int NS=210010;
const double eps=1e-8;

struct Edge{
    int u,v,w;
    Edge(){}
    Edge(int x,int y,int z):u(x),v(y),w(z){}
    bool operator < (const Edge &cmp)const{
        return w>cmp.w;
    }
}edge[NS];

int n;
int fa[NS],num[NS];
LL val[NS];

int dfs(int x)
{
    if (x!=fa[x]) fa[x]=dfs(fa[x]);
    return fa[x];
}

int main()
{
    while (~scanf("%d",&n))
    {
        int m=n-1;
        int u,v,w,x,y;
        for (int i=1;i<=n;i++)
        {
            fa[i]=i;
            num[i]=1;
            val[i]=0;
        }

        for (int i=0;i<m;i++)
        {
            scanf("%d %d %d",&u,&v,&w);
            edge[i]=Edge(u,v,w);
        }
        sort(edge,edge+m);

        LL s1,s2;
        for (int i=0;i<m;i++)
        {
            u=edge[i].u;
            v=edge[i].v;
            w=edge[i].w;

            x=dfs(u); y=dfs(v);
            s1=val[x]+(LL)num[y]*w;
            s2=val[y]+(LL)num[x]*w;
            val[x]=max(s1,s2);
            num[x]+=num[y];
            fa[y]=x;
        }
        printf("%I64d\n",val[dfs(u)]);
    }
    return 0;
}