HDU - 1102 Constructing Roads prim算法

最小生成树 入门级别

prim算法 已经修好的路看做花费为0

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <time.h>
// cout << "  ===  " << endl;

using namespace std;
typedef long long ll;
const int maxn = 100 + 7, INF = 0x3f3f3f3f, mod = 1e9+7;
int T, n, m;
int dis[maxn][maxn];
int d[maxn], vis[maxn];


void init() {
    int x, u, v;
    memset(vis, 0, sizeof vis);
    memset(dis, INF, sizeof dis);
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j) {
            scanf("%d", &x);
            dis[i][j] = dis[j][i] = x;
        }
    }
    scanf("%d", &m);
    for(int i = 0; i < m; ++i) {
        scanf("%d %d", &u, &v);
        dis[u][v] = dis[v][u] = 0;
    }
}

void solve() {
    int ans = 0;
    memset(d, INF, sizeof d);
    for(int i = 1; i <= n; ++i)
        d[i] = dis[1][i];
    vis[1] = 1;
    for(int j = 0; j < n; ++j) {
        int t = -1;
        for(int i = 1; i <= n; ++i)
            if(!vis[i] && (t == -1 || d[i] < d[t])) t = i;
        ans += d[t]; vis[t] =1;
        for(int i = 1; i <= n; ++i) {
            d[i] = min(d[i], dis[t][i]);
        }
    }
    cout << ans << endl;
}

int main() {
    while(scanf("%d", &n) != EOF && n) { 
        init();
        solve();
    }
    return 0;
}