A - 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. 

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

题目大意：最上面的是几行是从 i 到 j 路程花费，第n+1行是每个城市的税费，最后几行是从一城市到另一城市的最小花费。

解题思路：就是用floyd_warshall算法记录路径，然后求出路程花费加上税费的和。

然后注意一下输出是的格式即可，具体的看代码；

#include<stdio.h>
#include<algorithm>
#include<string.h>
#define inf 0x3f3f3f3f
int mp[120][120],way[120][120],cost[120];
int n;
void fand()
{
    int i,j,k;
    for(k=1; k<=n; k++)
    {
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
            {
                if(mp[i][j]>mp[i][k]+mp[k][j]+cost[k])
                {
                    mp[i][j]=mp[i][k]+mp[k][j]+cost[k];
                    way[i][j]=way[i][k];
                }
                else
                {
                    if(mp[i][j]==mp[i][k]+mp[k][j]+cost[k])
                    {
                        if(way[i][j]>way[i][k])
                            way[i][j]=way[i][k];
                    }
                }
            }
    }
}
int main()
{

    while(~scanf("%d",&n)&&n)
    {
        int i,j,k;
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
            {
                scanf("%d",&mp[i][j]);
                if(mp[i][j]==-1)
                    mp[i][j]=inf;
                way[i][j]=j;
            }
        for(i=1; i<=n; i++)
            scanf("%d",&cost[i]);
        int a,b;
        while(~scanf("%d%d",&a,&b))
        {
            if(a==-1&&b==-1)
                break;
            fand();
            printf("From %d to %d :\n",a,b);
            printf("Path: ");
            int tx=a;
            while(a!=b)
            {
                printf("%d-->",a);
                a=way[a][b];
            }
            printf("%d\nTotal cost : %d\n\n",b,mp[tx][b]);

        }
    }
    return 0;
}