HDU 1301 Jungle Roads

点击打开题目链接

哦。。。看着题目那么长  其实就是最小生成树。。。。

把输出处理一下就可以了

#include <iostream>
#include <cstdio>
#define INF 0x3f3f3f3f
using namespace std;
int map[50][50], vis[1000];
int t;
void prim()
{
    int sum = 0, min, k;
    for(int i = 1; i <= t; i++)
        vis[i] = map[1][i];
    for(int i = 2; i <= t; i++)
    {
        min = INF;
        for(int j = 1; j <= t; j++)
        {
            if(vis[j]!=0&&vis[j] < min)
            {
                min = vis[j];
                k = j;
            }

        }
        sum+=min;
        vis[k] = 0;
        for(int j = 1; j <= t; j++)
            if(map[k][j]!=0&&map[k][j] < vis[j])
            vis[j] = map[k][j];
    }
    printf("%d\n",sum);
}
int main()
{
    while(~scanf("%d",&t),t)
    {
        char a, b;
        int n, m, x, y;
        for(int i = 1; i <= t; i++)
            for(int j = 1; j <= t; j++)
            {
                map[i][j] = INF;
                if(i==j)
                    map[i][j] = 0;
            }
        for(int i = 1; i < t; i++)
        {
            scanf(" %c%d",&a,&n);
            x = a - 'A' + 1;
            for(int j = 1; j <= n; j++)
            {
                scanf(" %c%d",&b,&m);
                y = b - 'A' + 1;
                map[x][y] = map[y][x] = m;
            }
        }
        /*for(int i = 1; i <= t; i++)
        {
            for(int j = 1; j <= t; j++)
            {
                printf("%d ",map[i][j]);
            }
            printf("\n");
        }*/
        prim();
    }
    return 0;
}