HDU 1301(prim+字符串处理)

题意：可以说不用看题里面具体是什么，只要看数据就行了。

题中加字符串处理。有必要练习。

#include<cstdio>
#include<cstring>

#define inf 0x3f3f3f3f

int n;
int gragh[50][50];
int visit[50];
int dis[50];
int ans;

void prim()
{
    for(int i = 1;i <= n; i++){
        dis[i] = gragh[1][i];
    }
    memset(visit,0,sizeof(visit));
    visit[1] = true;
    for(int i = 1;i < n; i++){
        int Min = inf;
        int pos;
        for(int j = 2;j <= n; j++){
            if(visit[j] == 0 && dis[j] < Min){
                Min = dis[j];
                pos = j;
            }
        }
        ans += dis[pos];
        visit[pos] = true;
        for(int j = 1;j <= n; j++){
            if(visit[j] == 0 && dis[j] > gragh[pos][j])
                dis[j] = gragh[pos][j];
        }
    }
}

int main()
{
 //   freopen("in.txt","r",stdin);
    while(scanf("%d",&n) != EOF){
        if(n == 0)
            break;
        if(n == 1){
            printf("0\n");
            continue;
        }

        memset(gragh,inf,sizeof(gragh));
        char s1,s2;
        int a,b,c;
        for(int i = 1;i <= n-1; i++){
            int m;
            scanf("%s%d",&s1,&m);
            a = s1 - 'A' + 1;
            for(int j = 1;j <= m; j++){
                scanf("%s%d",&s2,&c);
                b = s2 - 'A' + 1;
                if(gragh[a][b] > c)
                    gragh[a][b] = gragh[b][a] = c;
            }
        }
        ans = 0;
        prim();
        printf("%d\n",ans);
    }
    return 0;
}