ACM学习之路___HDU 1385(带路径保存的 Floyd)

Description

　　These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to another. The transportation fee consists of two parts: 
The cost of the transportation on the path between these cities, and

a certain tax which will be charged whenever any cargo passing through one city, except for the source and the destination cities.

You must write a program to find the route which has the minimum cost.

 

Input

First is N, number of cities. N = 0 indicates the end of input.

The data of path cost, city tax, source and destination cities are given in the input, which is of the form:

a11 a12 ... a1N 
a21 a22 ... a2N 
............... 
aN1 aN2 ... aNN 
b1 b2 ... bN

c d 
e f 
... 
g h

where aij is the transport cost from city i to city j, aij = -1 indicates there is no direct path between city i and city j. bi represents the tax of passing through city i. And the cargo is to be delivered from city c to city d, city e to city f, ..., and g = h = -1. You must output the sequence of cities passed by and the total cost which is of the form:

 

Output

From c to d : 
Path: c-->c1-->......-->ck-->d 
Total cost : ...... 
......

From e to f : 
Path: e-->e1-->..........-->ek-->f 
Total cost : ......

Note: if there are more minimal paths, output the lexically smallest one. Print a blank line after each test case. 
//如果同时存在多条最短路径，按字典序选取最短路劲并且每个测试实例后输出一个空行

 

Sample Input

5

0 3 22 -1 4

3 0 5 -1 -1

22 5 0 9 20

-1 -1 9 0 4

4 -1 20 4 0

5 17 8 3 1

1 3

3 5

2 4

-1 -1

0

 

Sample Output

From 1 to 3 :

Path: 1-->5-->4-->3

Total cost : 21

From 3 to 5 :

Path: 3-->4-->5

Total cost : 16

From 2 to 4 :

Path: 2-->1-->5-->4

Total cost : 17  

　　简单带路径保存的Floyd（新手没啥经验，不熟练，记下方便回味）

 #include <iostream>
 #include <cstdio>
 using namespace std;
 const int MAXINT = <<;
 int path[][];
 int num[][];
 int num1[];
 int n;
 void floyd()
 {
     for(int k= ; k<=n ; k++)
         for(int i= ; i<=n ; i++)
             for(int j= ; j<=n ; j++)
             {
                 if(num[i][j] > (num[i][k]+num[k][j]+num1[k]) )
                 {
                     num[i][j] = num[i][k]+num[k][j]+num1[k];
                     path[i][j] = path[i][k];
                 }
                 else if(num[i][j] == num[i][k]+num[k][j]+num1[k])
                 {
                     if(path[i][j] > path[i][k])
                         {
                             path[i][j] = path[i][k];
                             num[i][j] = num[i][k]+num[k][j]+num1[k];
                         }
                 }//attention 当存在多条最短路时，选取后驱小的路
             }
 }
 void print(int a,int b)
 {
     if(a == b)
     {
         printf("%d\n",b);
         return;
     }
     printf("%d-->",a);
     a=path[a][b];
     print(a,b);
 }//路径输出函数

 int main()
 {
     int i,j,a,b;
     while(scanf("%d",&n),n)
        {
         for(i= ; i<=n ; i++)
           for(j= ; j<=n ; j++)
             {
                 scanf("%d",&num[i][j]);
                 if(num[i][j]==-)
                     num[i][j]=MAXINT;
                 path[i][j]=j;//记后驱，方便输出
             }
             for(i= ; i<=n ; i++)
                 scanf("%d",&num1[i]);
             floyd();
             while(scanf("%d%d",&a,&b))
             {
                 if(a == - && b == -)
                     break;
                 printf("From %d to %d :\n",a,b);
                 printf("Path: ");
                 print(a,b);
                 printf("Total cost : %d\n\n",num[a][b]);
             }
        }
     return ;
 }