hdu1385Minimum Transport Cost

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
  
  
  
  

   
   这道题使用了floyed算法，与之前不同的是，这道题需要打印字典序最小的路径，那么用path【i】【j】=k的方法肯定是行不通的，所以，这里将path【i】【j】=j，也就是
  
  
  
  

   
   记录第二个元素，每一次找到更短的路径时，将path[i][j]=path[i][k],那么path【i】【j】记录的便是到i最短路径的结点，当路径相等时，取小的k值就可以了。
  
  
  
  

   
   
#include<string.h>
#include<stdio.h>
#define INF 65533
int map[1001][1001];
int path[1001][1001];//path[a][b]表示a到b的所有路径中的与a最近的一个
int tax[1001];
int n;
void floyed()
{
    int i,j,k,dis;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            path[i][j]=j;
        }
    }
    for(k=1; k<=n; k++)
    {
        for(i=1; i<=n; i++)
        {
            for(j=1; j<=n; j++)
            {
                dis=map[i][k]+map[k][j]+tax[k];//切记k  j不可调换顺序，否则会otl
                if(dis<map[i][j])
                {
                    map[i][j]=dis;
                    path[i][j]=path[i][k];
                }
                if(dis==map[i][j])
                {
                    if(path[i][k]<path[i][j])
                        path[i][j]=path[i][k];

                }



            }
        }
    }


}
int main()
{
    int i,j,a,b,c;
    while(scanf("%d",&n),n)
    {
        for(i=1; i<=n; i++)
        {
            for(j=1; j<=n; j++)
            {
                scanf("%d",&map[i][j]);
                if(map[i][j]==-1)
                    map[i][j]=INF;
            }
        }
        for(i=1; i<=n; i++)
            scanf("%d",&tax[i]);
        floyed();
        while(scanf("%d%d",&a,&b)!=EOF)
        {
            if(a==-1&&b==-1)break;
            c=a;
            printf("From %d to %d :\n", a, b);
            printf("Path: %d",a);
            while(c!=b)
            {
                printf("-->%d",path[c][b]);
                c=path[c][b];

            }
            printf("\n");
			printf("Total cost : %d\n\n",map[a][b]);


        }

    }
    return 0;

}