F - Minimum Transport Cost（最短路）

                                  

F - Minimum Transport Cost

  HDU - 1385 

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. 

InputFirst 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: 
OutputFrom 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

题解：

最短路径问题，就是给你一个邻接矩阵，然后让你求任意两段路之间的最短路径，同时加上通过的某个城市的路费。我是用佛洛伊德做的。

定义一个二维数组path[i][j]，用来存储最短路径上的顶点Vj的前一个顶点的序号，

d[i][j]记录顶点Vj和Vj之间的最短路径长度。

首先是对该邻接矩阵进行初始化，然后进行三重循环，floyd判断，当找到最短路径的时候，就把它给更新， 也就是更新i的前驱为k。

注意一下：就是的d[i][j]是从Vi到Vj的中间顶点的序号不大于k的最短路径的长度。d[i][j]就是从Vi到Vj的最短路径的长度。

#include<stdio.h>
#include<string.h>
#define inf 1<<25
const int N=1000;
int path[N][N],d[N][N],tax[N];
int floyd(int n)
{
    for(int i=1;i<=n;i++)
     for(int j=1;j<=n;j++)
     path[i][j]=j;

    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
            {
                if(d[i][k]<inf&&d[k][j]<inf)
                {
                    int temp=d[i][k]+d[k][j]+tax[k];
                    if(temp<d[i][j])
                    {
                        d[i][j]=temp;
                        path[i][j]=path[i][k];
                    }
                    else if(temp==d[i][j])
                    {
                        if(path[i][j]>path[i][k])
                            path[i][j]=path[i][k];
                    }
                }
            }
}

int main()
{
    int n,i,j,s,t;
    while(~scanf("%d",&n)&&n)
    {
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
        {
            scanf("%d",&d[i][j]);
            if(d[i][j]==-1)
                d[i][j]=inf;
        }


        for(i=1;i<=n;i++)
            scanf("%d",&tax[i]);
        floyd(n);

        while(~scanf("%d%d",&s,&t))
        {
            if(s==-1&&t==-1)
                break;
            printf("From %d to %d :\n",s,t);
            printf("Path: %d",s);
            int temp=s;
            while(temp!=t)
            {
                printf("-->%d",path[temp][t]);
                temp=path[temp][t];
            }

            printf("\n");
            printf("Total cost : %d\n",d[s][t]);
            printf("\n");
         }


    }
    return 0;
}