给定一颗树,边上有权值,让求从一点出发到其他所有点路径上最小权之和尽量打,输出最大值。
思路: 考虑每个最小边权的边若获得了两边联通分量的最大值,那么该树的最大值也就递推了出来,这样直接递归求最大值,由于正向写系数较大,可以考虑倒过来,权值从
大到小,然后用并查集合并即可。
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <cassert>
#define ALL(a) a.begin(), a.end()
#define clr(a, x) memset(a, x, sizeof a)
#define fst first
#define snd second
#define pb push_back
#define lowbit(x) (x&(-x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define rep1(i,x,y) for(int i=x;i<=y;i++)
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
const double eps = 1e-10;
typedef long long LL;
typedef long long ll;
typedef pair<int, int> pii;
const int oo =0x3f3f3f3f;
const int N = 1e6;
int pa[N],n,cnt[N];
ll sum[N];
struct node{
int u,v,cap;
node(int u=0,int v=0,int cap=0):u(u),v(v),cap(cap){}
bool operator<(const node& rhs)const{
return cap > rhs.cap;
}
}a[N];
int find(int x){ return (pa[x]==x ? x : pa[x]=find(pa[x])); }
void Union(int x,int y,int c){
int px = find(x) , py = find(y);
sum[py] = max(sum[px]+(ll)cnt[py]*c,sum[py]+(ll)cnt[px]*c);
pa[px] = py;
cnt[py]+=cnt[px];
}
int main()
{
while(scanf("%d",&n)==1){
rep1(i,1,n-1) scanf("%d %d %d",&a[i].u,&a[i].v,&a[i].cap);
rep1(i,1,n) pa[i]=i,cnt[i]=1,sum[i]=0;
sort(a+1,a+n);
rep1(i,1,n-1) Union(a[i].u,a[i].v,a[i].cap);
cout<<sum[find(1)]<<endl;
}
return 0;
}