UVa OJ 567

1、本题就是求无权图上任意两点间最短距离，用Floyd算法即可，一次AC~

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int INF=100;
int main()
{
    //freopen("a.txt","r",stdin);
    int num,temp,x,y,kase=0;
    int G[25][25],d[25][25];
    while(scanf("%d",&num)==1){
        memset(G,0,sizeof(G));
        printf("Test Set #%d\n",++kase);
        for(int i=0;i<num;i++){
           scanf("%d",&temp);
             G[1][temp]=1;
             G[temp][1]=1;
        }
        for(int i=2;i<=19;i++){
            scanf("%d",&num);
            for(int j=0;j<num;j++){
               scanf("%d",&temp);
               G[i][temp]=1;
               G[temp][i]=1;
            }
        }
        for(int i=1;i<=20;i++)
          for(int j=1;j<=20;j++){
             if(i==j) d[i][j]=0;
             else if(!G[i][j])d[i][j]=INF;
              else d[i][j]=1;
          }
        for(int k=1;k<=20;k++)
         for(int i=1;i<=20;i++)
            for(int j=1;j<=20;j++)
              if(d[i][k]<INF&&d[k][j]<INF)
                 d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
        scanf("%d",&num);
        for(int i=0;i<num;i++){
            scanf("%d%d",&x,&y);
            printf("%2d to %2d: %d\n",x,y,d[x][y]);
        }
        printf("\n");
    }
    return 0;
}