hdu1233 prim

#include <iostream>
#include <memory.h>
#include <cstdio>
using namespace std;

const int MAX = 1<<20;
const int N = 111;
int mp[N][N];
int lowcost[N];
int vis[N];
int n, ans;

void prim()
{
    int i,j,pos,Min;
    for (i = 1;i <= n; ++ i)
        lowcost[i] = mp[1][i];
    vis[1] = 1;
    for (i = 1;i <= n; ++ i)  {
        Min = MAX;
        for (j = 1;j <= n; ++ j) {
            if (Min > lowcost[j] && !vis[j])
            {
                pos = j;
                Min = lowcost[j];
            }
        }
        vis[pos] = 1;
        for (j = 1 ;j <= n; ++ j)
            if (!vis[j] && mp[pos][j] < lowcost[j])
                lowcost[j] = mp[pos][j];
    }
    for (j = 1;j <= n;++ j)   //因为mp[1][1] = 0
        ans += lowcost[j];
}

void init()
{
    memset(lowcost,0,sizeof(lowcost));
    memset(vis,0,sizeof(vis));
    for (int i  = 0;i <= n; ++ i)
        for (int j = 0;j <= n;++ j) {
        mp[i][j] = MAX;
        if (i == j)
            mp[i][j] = 0;
    }
}


int main()
{
    while (~scanf("%d",&n),n)
    {
        init();
        int m = n*(n-1)/2;
        for (int i = 0;i < m; ++ i)
        {
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);           
             if (mp[a][b] > c)
                mp[a][b] = mp[b][a] = c;
        }
        ans = 0;
        prim();
        cout << ans << endl;
    }
    return 0;
}

裸体 不解释