【并查集】hdu5176

题目大意：对于树上每一条路径，最大边权减去最小边权的值为love worth，然后求所有路径的loveworth之和。

解法也很好想，算出来每一条边的最大边权贡献和最小边权贡献。然后相减就好；

从大到小排求最小边权贡献和

从小到大排求最大边权贡献和

。。。

然后说重点。。

这个题。。在getfather的时候要写手动栈。。。。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdlib>
using namespace std;
int fa[200100],size[200100],n,q[200100],tail=0;
struct rec{int x,y,w;}bian[200100];
int cmp1(rec x,rec y)
{
    return x.w<y.w;
}
int cmp2(rec x,rec y)
{
    return x.w>y.w;
}
int getfather(int x)
{
    int flag;
    tail=1;
    q[tail]=x;
    for (;;)
    {
        flag=false;
        if (fa[q[tail]]==q[tail])
        {
            tail--;
            while (tail>0) 
            {
                fa[q[tail]]=fa[q[tail+1]];
                tail--;
            }
            flag=true;
        }
        if (flag==true) break;
        q[tail+1]=fa[q[tail]];
        tail++;
    }
    return fa[q[1]];
}
unsigned long long work()
{
    unsigned long long now=0;
    int gen1,gen2;
    for (int i=1;i<=n-1;i++)
    {
        gen1=getfather(bian[i].x);
        gen2=getfather(bian[i].y);
        now+=(unsigned long long)size[gen1]*(unsigned long long)size[gen2]*(unsigned long long)bian[i].w;
        fa[gen1]=gen2;
        size[gen2]=size[gen2]+size[gen1];
    }
    return now;
}
void clean()
{
     for (int i=1;i<=n;i++)
     {
         fa[i]=i;
         size[i]=1;
     }
}
int main()
{
    freopen("test.in","r",stdin);
    freopen("test.out","w",stdout);
    unsigned long long maxf,minf;
    int ci=0;
    while (scanf("%d",&n)!=EOF)
    {
        ci++;
        printf("Case #%d: ",ci);
        memset(bian,0,sizeof(bian));
        maxf=0;minf=0;
        for (int i=1;i<=n-1;i++)
            scanf("%d %d %d",&bian[i].x,&bian[i].y,&bian[i].w);
        clean();
        sort(bian+1,bian+n,cmp1);
        maxf=work();
        clean();
        sort(bian+1,bian+n,cmp2);
        minf=work();
        printf("%I64u\n",maxf-minf);
    }
    return 0;
}