POJ 3585 (dp)

一眼看过去还以为是网络流，想想复杂度好像高了点…后来发现书上是做了树上的dp（二次扫描，换根）…emmm，反正还是觉得挺神奇的。思路可以看进阶指南p267…

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
struct edge {
    int to, cap;
};
vector<edge>G[200005];
int d[200005], f[200005], vis[200005], degree[200005];
void dp(int x)
{
    vis[x] = 1;
    for (int i = 0; i < G[x].size(); i++) {
        edge t = G[x][i];
        if (vis[t.to])continue;
        dp(t.to);
        if (degree[t.to] == 1)d[x] += t.cap;//如果度为1，则只有边容量会限制
        else d[x] += min(t.cap, d[t.to]);
    }
}
void dfs(int x)
{
    vis[x] = 1;
    for (int i = 0; i < G[x].size(); i++) {
        edge t = G[x][i];
        if (vis[t.to])continue;
        if (degree[x] == 1)f[t.to] = d[t.to] + t.cap;
        else f[t.to] = d[t.to] + min((f[x] - min(t.cap, d[t.to])), t.cap);//这里要小心里面的f[x]和d[t.to]，f和d不要搞混！！
        dfs(t.to);
    }
}
int main()
{
    int t, n, i, j, k;
    cin >> t;
    while (t--) {
        memset(f, 0, sizeof(f)); memset(d, 0, sizeof(d)); memset(vis, 0, sizeof(vis)); memset(degree, 0, sizeof(degree));
        cin >> n;
        for (i = 1; i <= n; i++)G[i].clear(); int a, b, c;
        for (i = 1; i < n; i++) {
            scanf("%d %d %d", &a, &b, &c); degree[a]++, degree[b]++;//算度
            G[a].push_back(edge{ b,c }); G[b].push_back(edge{ a,c });
        }
        dp(1); memset(vis, 0, sizeof(vis));
        f[1] = d[1];//这个不要忘了！！！
        dfs(1);
        int ans = 0;
        for (i = 1; i <= n; i++)
            ans = max(ans, f[i]);
        cout << ans << endl;
    }

    return 0;
}