http://acm.hdu.edu.cn/showproblem.php?pid=1385

Minimum Transport Cost

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7550 Accepted Submission(s): 1941

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

50 3 22 -1 43 0 5 -1 -122 5 0 9 20-1 -1 9 0 44 -1 20 4 05 17 8 3 11 33 52 4-1 -10

Sample Output

From 1 to 3 :Path: 1-->5-->4-->3Total cost : 21From 3 to 5 :Path: 3-->4-->5Total cost : 16From 2 to 4 :Path: 2-->1-->5-->4Total cost : 17
输出路径的时候注意，是否真确会不会出现3-->3的情况！
#include <iostream>#include <cstdio>using namespace std;const int maxn = 65533;int grap[100][100];int path[100][100];int cost[100];int n;void init() {   for (int i = 1; i <= n; i ++) {    for (int j = 1; j <= n; j ++) {        path[i][j] = j;    }   }}void floyd() {   for (int k = 1; k <= n; k ++) {    for (int i = 1; i <= n; i ++) {        for (int j = 1; j <= n; j ++) {            int w = grap[i][k]+grap[k][j]+cost[k];            if (grap[i][j] > w) {                grap[i][j] = w;                path[i][j] = path[i][k];            }            if (grap[i][j] == w) {               path[i][j] = min(path[i][j], path[i][k]);            }        }    }   }}int main() {   while (scanf("%d", &n),n) {    for (int i = 1; i <= n; i ++) {        for (int j = 1; j <= n; j ++) {            scanf("%d", &grap[i][j]);            if (grap[i][j] == -1) grap[i][j] = maxn;        }    }    for (int i = 1; i <= n; i ++) {        scanf("%d", &cost[i]);    }    init();    floyd();    int x, y;    while (scanf("%d%d", &x, &y), x!=-1 && y!=-1) {        int ans = grap[x][y];        printf("From %d to %d :\n", x,y);        printf("Path: %d", x);        while (x != path[x][y]) {            printf("-->%d", path[x][y]);            x = path[x][y];        }        printf("\n");        printf("Total cost : %d\n\n", ans);    }   }return 0;}