题
给定一棵树,问以其为唯一最小生成树的完全图的边权和最大为多少。
解
并查集维护大小,按 Kruscal K r u s c a l 的方法,每次贪心连边。代码见下:
#include <bits/stdc++.h>
using namespace std;
#define R register
#define Maxn 20005
#define LL long long
int T,n,fa[Maxn],siz[Maxn];
LL ans;
struct edge
{
int l,r,w;
}e[Maxn];
int find(R int x)
{
return (fa[x]^x)?fa[x]=find(fa[x]):x;
}
inline bool cmp(R edge x,R edge y){return x.w<y.w;}
int main()
{
scanf("%d",&T);
while (T--)
{
scanf("%d",&n);
ans = 0ll;
for (R int i=1;i<n;++i)
scanf("%d %d %d",&e[i].l,&e[i].r,&e[i].w),siz[i]=1,fa[i]=i,ans+=e[i].w;
fa[n]=n,siz[n]=1;
sort(e+1,e+n,cmp);
for (R int i=1;i<n;++i)
{
R int u=find(e[i].l),v=find(e[i].r);
ans += (LL)(siz[u]*siz[v]-1)*(e[i].w+1);
fa[u]=v,siz[v]+=siz[u];
}
printf("%lld\n",ans);
}
return 0;
}