原题链接:https://www.luogu.org/problemnew/show/P1131
题目大意
给一个有边权的有根树,定义一次操作为任意选一条边,并使其边权加一,问最少需要多少操作可以使根到每个叶子的距离相等。
解法
这个题目感觉比较好,若要树同步,则各个子树要同步,一直递归下去……
#include <iostream>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define pb push_back
using namespace std;
typedef long long LL;
const int N=500000+5;
struct Edge{
int v,w;
Edge(int v1,int w1):v(v1),w(w1){}
};
vector<Edge> Adj[N];
int n,r,d[N];
LL ans=0,dp[N];
void dfs(int u,int fa){
LL tmp=0;
forn(j,Adj[u].size()){
int v=Adj[u][j].v;
int w=Adj[u][j].w;
if(v!=fa){
dfs(v,u);
tmp=max(tmp,LL(dp[v])+w);
}
}
forn(j,Adj[u].size()){
int v=Adj[u][j].v;
int w=Adj[u][j].w;
if(v!=fa){
ans+=tmp-(LL(dp[v])+w);
}
}
dp[u]=tmp;
}
int main() {
#ifdef LOCAL_DEFINE
freopen("input.in", "rt", stdin);
#endif
int u,v,w;
scanf("%d",&n);
scanf("%d",&r);
for1(i,n-1){
scanf("%d%d%d",&u,&v,&w);
Adj[u].pb(Edge(v,w));
Adj[v].pb(Edge(u,w));
}
dfs(r,0);
printf("%lld\n",ans);
#ifdef LOCAL_DEFINE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}