dfs一遍求出每个子树的大小
统计一下每条边经过的次数,排序赋值即可
代码:
typedef long long ll;
using namespace std;
const int MAXN=1e5+50;
const int inf=0x3f3f3f3f;
const int M=5000*4;
const int mod=1e9+7;
int n;
vector<int>p[MAXN];
ll ans;
ll dp[MAXN];//子树大小
ll x[MAXN];//经过每条边的次数
struct sa{
int u;
int v;
}mp[MAXN];
void dfs(int x,int fa){
dp[x]=1;
int len=p[x].size()-1;
for(int i=0;i<=len;i++){
int y=p[x][i];
if(y==fa)continue;
dfs(y,x);
dp[x]+=dp[y];
}
}
int main()
{
//std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n;
for(int i=1;i<=n-1;i++){
int u,v;
scanf("%d%d",&u,&v);
mp[i].u=u,mp[i].v=v;
p[u].pb(v);
p[v].pb(u);
}
ll sum=0;
dfs(1,0);
ll ans=0;
for(int i=1;i<=n-1;i++){
//ans+=dp[i];
ll pkl=min(dp[mp[i].u],dp[mp[i].v]);
x[i]=pkl*(n-pkl);
}
sort(x+1,x+n-1+1);
ll sb=0;
for(int i=1;i<=n-1;i++){
sb+=(n-i)*(x[i]);
}
cout<<sb<<endl;
return 0;
}
/*
*/