Poj 1258 Agri-Net

裸的最小生成树

学习了下prim

裸打的1Y

#include<stdio.h>
#include<algorithm>
#define INF ((int)1e9)
#define N 110
using namespace std;
int G[N][N];
int low[N];
int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        int i,j;
        for(i=1;i<=n;i++)for(j=1;j<=n;j++)scanf("%d",&G[i][j]);
        for(i=1;i<=n;i++)low[i]=G[1][i];
        int res=0;
        for(i=2;i<=n;i++){
            int in=INF,pmin;
            for(j=2;j<=n;j++)if(low[j]&&low[j]<in)in=low[j],pmin=j;
            low[pmin]=0;res+=in;
            for(j=2;j<=n;j++)low[j]=min(low[j],G[pmin][j]);
            }
        printf("%d\n",res);
        }
    return 0;
    }