1 #include
      
        2 #include
       
         3 const int oo = 1<<28 ; 4 const int maxn = 1005 ; 5 int map[maxn][maxn] ; 6 int visit[maxn] ; 7 int n, m ; 8 int len ; 9 int floyd()10 {11     for(int k=1; k<=len; k++)12     {13        for(int i=1; i<=len; i++)14        {15           for(int j=1; j<=len; j++)16           {17               if(!visit[j]&&map[i][k]+map[k][j]
        
         w)51             {52                 map[u][v] = w ;53                 map[v][u] = w ;54             }55             if(u>len) len = u ;56             if(v>len) len = v ;57         }58         memset(visit, 0, sizeof(visit)) ;59         map[0][1] = 0 ;60         floyd() ;61         printf("%d\n", map[1][n]) ;62     }63     return 0 ;64 }