洛谷 P1546 最短网络 Agri-Net

题目传送门

解题思路:

一道裸的最小生成树,题解传送门

AC代码:

#include<cstdio>
#include<iostream>
#include<cstring>

using namespace std;

int n,g[101][101],dis[101],ans; 
bool p[101];

void Prim() {
    dis[1] = 0;
    p[1] = true;
    for(int i = 1;i < n; i++) {
        int k = 0;
        for(int j = 1;j <= n; j++) 
            if(!p[j] && dis[j] < dis[k])
                k = j;
        p[k] = true;
        ans += dis[k];
        for(int j = 1;j <= n; j++)
            dis[j] = min(dis[j],g[k][j]);
    }
}

int main()
{
    memset(g,0x3f,sizeof(g));
    scanf("%d",&n);
    for(int i = 1;i <= n; i++) 
        for(int j = 1;j <= n; j++)
            scanf("%d",&g[i][j]);
    for(int i = 0;i <= n; i++)
        dis[i] = g[1][i];
    Prim();
    printf("%d",ans);
    return 0;
}