hdu1233还是畅通工程

来源：互联网发布：mac系统玩国服lol 编辑：程序博客网时间：2024/05/13 07:22

注意要用scanf 如果要用cin 则会超时；

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
template<class T> bool up_max(T& a,const T& b) {return b>a? a=b,1:0;}
template<class T> bool up_min(T& a,const T& b) {return b<a? a=b,1:0;}
const int inf = 1000000000;
const int maxn = 100;
int g[maxn][maxn];
int dis[maxn];
int vis[maxn];
int N;
int prime()
{
    for(int i = 1; i <= N; i++)
        vis[i] = 0;
    for(int i = 2; i <= N; i++)
        dis[i] = g[1][i];
    vis[1] = 1;
    int mindance = 0;
    for(int i = 1; i < N; i++)
    {
        int mindis = inf, idx = -1;
        for(int j =1; j <= N; j++)
        {
            if(!vis[j]&&up_min(mindis, dis[j]))
                idx = j;
        }
        vis[idx] = 1;
        mindance += mindis;
        for(int k = 1; k <= N; k++)
            if(!vis[k])
                up_min(dis[k], g[idx][k]);
    }
    return mindance;
}
int main()
{
    int u, v, w;
    while(scanf("%d",&N)!=EOF)
    {
        if(N==0) break;
        int m = N*(N-1)/2;
        while(m--)
        {
            scanf("%d%d%d", &u, &v, &w);
            g[u][v] = w;
            g[v][u] = w;
        }
        int mindance = prime();
        printf("%d\n", mindance);
    }
    return 0;
}