POJ3585 Accumulation Degree

提交地址：POJ3585

经典的树形DP，二次扫描与换根法
思路
设D[x] 为以x为根的子树中，把x作为源点，从x发出的流量的最大值，这个很用dfs扫描一次可以得出。
然后就是换根了，设F[x]为以x作为整棵树的根是所求的答案
可以画一个图理解一下

转移

if(Deg[Stx] == 1) f[Now] = Val[Now] + Edge[i].Wei;
			else f[Now] = min(f[Stx] - min(Val[Now],Edge[i].Wei),Edge[i].Wei) + Val[Now];
			dp(Now);

Code

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAXN = 200005;
inline int Set() {
	int a = 0;
	char ch = getchar();
	while (!(ch >= '0' && ch <= '9')) ch = getchar();
	while (ch >= '0' && ch <= '9') {
		a = a * 10 + (ch - '0');
		ch = getchar();
	}
	return a;
}
inline void Print(int x) {
	char buffer[20];
	int length = 0;
	bool minus = x < 0;
	if (minus) x = -x;
	do {
		buffer[length++] = x % 10 + '0';
		x /= 10;
	} while (x);
	if (minus) buffer[length++] = '-';
	do {
		putchar(buffer[--length]);
	} while (length);
	putchar('\n');
}
struct _Edge {
	int Next;
	int End;
	int Wei;
} Edge[MAXN * 2];
int Head[MAXN],Cnt,Val[MAXN],Vis[MAXN],f[MAXN],Deg[MAXN];
inline void Add(int u,int v,int w) {
	Cnt ++;
	Edge[Cnt].Next = Head[u];
	Edge[Cnt].End = v;
	Edge[Cnt].Wei = w;
	Head[u] = Cnt;
}
void Dfs(int Stx) {
	Vis[Stx] = 1;
	for(int i = Head[Stx]; i; i = Edge[i].Next) {
		int Now = Edge[i].End;
		if(!Vis[Now]) {
			Dfs(Now);
			if(Deg[Now] == 1) Val[Stx] += Edge[i].Wei;
			else Val[Stx] += min(Edge[i].Wei,Val[Now]);
		}
	}
	Vis[Stx] = 0;
}
void dp(int Stx) {
	Vis[Stx] = 1;
	for(int i = Head[Stx]; i; i = Edge[i].Next) {
		int Now = Edge[i].End;
		if(!Vis[Now]) {
			if(Deg[Stx] == 1) f[Now] = Val[Now] + Edge[i].Wei;
			else f[Now] = min(f[Stx] - min(Val[Now],Edge[i].Wei),Edge[i].Wei) + Val[Now];
			dp(Now);
		}
	}
	Vis[Stx] = 0;
}
void Init() {
	Cnt = 0;
	memset(Val,0,sizeof(Val));
	memset(Head,0,sizeof(Head));
	memset(Deg,0,sizeof(Deg));
}
int main() {
	int t = Set();
	while(t--) {
		Init();
		int n = Set();
		for(int i = 1; i<n; i++) {
			int x = Set(),y = Set(),z = Set();
			Deg[x] ++;
			Deg[y] ++;
			Add(x,y,z);
			Add(y,x,z);
		}
		Dfs(1);
		f[1] = Val[1];
		dp(1);
		int Ans = 0;
		for(int i = 1; i<=n; i++) Ans = max(Ans,f[i]);
		Print(Ans);
	}
	return 0;
}