最短路Floyd及输出路径 HDU 1385

Problem 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

 

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1385

题目大意：有N个城市，然后直接给出这些城市之间的邻接矩阵，矩阵中-1代表那两个城市无道路相连，其他值代表路径长度。 如果一辆汽车经过某个城市，必须要交一定的钱(可能是过路费)。 现在要从a城到b城，花费为路径长度之和，再加上除起点与终点外所有城市的过路费之和。 求最小花费，如果有多条路经符合，则输出字典序最小的路径。

 

运用Floyd算法求出每两点的最短路径即可。 对应输出路径。

 

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std ;
const int maxn = 500 + 10 ;
const int inf = 0x3f3f3f3f ;

int Map[maxn][maxn], pa[maxn][maxn] ;
int tax[maxn] ;

int main (){
    int n ;
    while (~scanf("%d", &n) && n){
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= n; j++){
                scanf("%d", &Map[i][j]) ;
                if (Map[i][j] == -1){
                    Map[i][j] = inf ;
                }
                pa[i][j] = j ;
            }
        }
        for (int i = 1; i <= n; i++){
            scanf("%d", &tax[i]) ;
        }
        for (int k = 1; k <= n; k++){
            for (int i = 1; i <= n; i++){
                for (int j = 1; j <= n; j++){
                    if (Map[i][j] > Map[i][k] + Map[k][j] + tax[k]){
                        Map[i][j] = Map[i][k] + Map[k][j] + tax[k] ;
                        pa[i][j] = pa[i][k] ;
                    }
                    else {
                        if (Map[i][j] == Map[i][k] + Map[k][j] + tax[k] && pa[i][j] > pa[i][k]){
                            pa[i][j] = pa[i][k] ;
                        }
                    }
                }
            }
        }
        int a, b;
        while (scanf("%d%d", &a, &b) && (a != -1 || b != -1)){
            printf("From %d to %d :\nPath: %d", a, b, a);
            int u = a, v = b;
            while (u != v){
                printf("-->%d", pa[u][v]);
                u = pa[u][v];
            }
            printf("\nTotal cost : %d\n\n", Map[a][b]);
        }
    }
    return 0 ;
}