poj1258

prim。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int inf = 1e9;
int N;
int e[105][105];
int d[105];
bool vis[105];
int res;
void prim()
{
    memset(vis, false, sizeof(vis));
    for(int i = 0; i < N; i ++)
        d[i] = e[0][i];
    vis[0] = true;
    int tmp, tmp2;
    for(int i = 0; i < N - 1; i ++)
    {
        tmp = inf;
        for(int j = 0; j < N; j ++)
            if(!vis[j] && tmp > d[j])
            {
                tmp = d[j];
                tmp2 = j;
            }
        res += tmp;
        vis[tmp2] = true;
        for(int j = 0; j < N; j ++)
            if(d[j] > e[tmp2][j])
                d[j] = e[tmp2][j];
    }
}

int main()
{
    while(scanf("%d", &N) != EOF)
    {
        res = 0;
        for(int i = 0; i < N; i ++)
            for(int j = 0; j < N; j ++)
                scanf("%d", &e[i][j]);
        prim();
        printf("%d\n", res);
    }
    // system("pause");
    return 0;
}