UVA 1664 Conquer a New Region

思路：有点像最小生成树那样，把边按照从大到小排序，然后并查集维护...非常巧妙的做法

#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int maxn = 200000+100;
int pre[maxn];
int Find(int x)
{
	return pre[x]==x?x:pre[x]=Find(pre[x]);
}
struct Edge
{
	int u,v,w;
}e[maxn];
LL sum[maxn];
int cnt[maxn];
bool cmp(Edge a,Edge b)
{
	return a.w>b.w;
}
void mix(int u,int v,int w)
{
	int uu = Find(u);
	int vv = Find(v);
	sum[vv]=max(sum[uu]+(LL)cnt[vv]*w,sum[vv]+(LL)cnt[uu]*w);
	cnt[vv]+=cnt[uu];
	pre[uu]=vv;
}

int main()
{
    int n;
	while (scanf("%d",&n)!=EOF)
	{
        for (int i = 1;i<=n-1;i++)
		{
			scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].w);
		}
		for (int i = 1;i<=n;i++)
		{
			pre[i]=i;
			sum[i]=0;
			cnt[i]=1;
		}
		sort(e+1,e+n,cmp);
		for (int i = 1;i<=n-1;i++)
			mix(e[i].u,e[i].v,e[i].w);
		printf("%lld\n",sum[Find(1)]);
	}
}

The wheel of the history rolling forward, our king conquered a new region in a distant continent.There are N towns (numbered from 1 to N) in this region connected by several roads. It’s confirmedthat there is exact one route between any two towns. Traffic is important while controlled colonies arefar away from the local country. We define the capacity C(i, j) of a road indicating it is allowed totransport at most C(i, j) goods between town i and town j if there is a road between them. And for aroute between i and j, we define a value S(i, j) indicating the maximum traffic capacity between i andj which is equal to the minimum capacity of the roads on the route.Our king wants to select a center town to restore his war-resources in which the total traffic capacitiesfrom the center to the other N −1 towns is maximized. Now, you, the best programmer in the kingdom,should help our king to select this center.InputThere are multiple test cases.The first line of each case contains an integer N. (1 ≤ N ≤ 200, 000)The next N − 1 lines each contains three integers a, b, c indicating there is a road between town aand town b whose capacity is c. (1 ≤ a, b ≤ N, 1 ≤ c ≤ 100, 000)OutputFor each test case, output an integer indicating the total traffic capacity of the chosen center town.Sample Input41 2 22 4 12 3 141 2 12 4 12 3 1Sample Output43