NEU 1132 Renew MST Quickly 增量最小生成树

增量最小生成树

根据最小生成树的回路性质 首先求出任意两点间的最大权值 以后每加入一条边 都会产生一条回路 删除这条回路的最大权值即可

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>

using namespace std;

const int maxn = 1000 + 10;

struct Node{
    int u, d;
    Node(int u = 0, int d = 0) : u(u), d(d){}
};

vector<Node> G[maxn];
int n, dist[maxn][maxn];
bool vis[maxn];

void dfs(int k, int cur, int max_d){
    for(int i = 0; i < G[cur].size(); i++)if(!vis[G[cur][i].u]){
        int v = G[cur][i].u;
        int d = G[cur][i].d;
        vis[v] = true;
        dist[k][v] = max(max_d, d);
        dfs(k, v, dist[k][v]);
    }
}

int main()
{
    int cas = 0;
    while(scanf("%d", &n) != EOF){
        int sum = 0;
        for(int i = 0; i < n; i++) G[i].clear();
        memset(dist, 0, sizeof(dist));
        for(int i = 0; i < n - 1; i++){
            int u, v, d;
            scanf("%d%d%d", &u, &v, &d);
            --u; --v;
            G[u].push_back(Node(v, d));
            G[v].push_back(Node(u, d));
            sum += d;
        }
        for(int i = 0; i < n; i++){
            memset(vis, false, sizeof(vis));
            vis[i] = true;
            dfs(i, i, 0);
        }
        int q;
        scanf("%d", &q);
        printf("Test #%d\n", ++cas);
        while(q--){
            int u, v, d;
            scanf("%d%d%d", &u, &v, &d);
            --u; --v;
            int ans = sum - dist[u][v] + min(dist[u][v], d);
            printf("%d\n", ans);
        }
    }
    return 0;
}