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
题目大意:在n城市之间运送货物,输出货物从城市u到城市to的最小运送费用和路径
解题思路:因为有多组任意两点城市之间的最小运费,floyd算法求,path数组保存字典序最小的后继
AC代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e3;
const int INF=0x3f3f3f3f;
int n,map[maxn][maxn],path[maxn][maxn],cost[maxn];
void get_map()
{
int x;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&x);
if(x==-1)
map[i][j]=INF;
else
{
map[i][j]=x;
path[i][j]=j;
}
}
}
for(int i=1;i<=n;i++)
scanf("%d",&cost[i]);
}
void floyd()
{
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]+cost[k])
{
map[i][j]=map[i][k]+map[k][j]+cost[k];
path[i][j]=path[i][k];
}
else if(map[i][j]==map[i][k]+map[k][j]+cost[k])
path[i][j]=min(path[i][j],path[i][k]);
}
}
}
}
void print()
{
int u,to;
while(~scanf("%d%d",&u,&to)&&u!=-1&&to!=-1)
{
printf("From %d to %d :\n",u,to);
printf("Path: %d",u);
int term=u;
while(term!=to)
{
printf("-->%d",path[term][to]);
term=path[term][to];
}
printf("\nTotal cost : %d\n\n", map[u][to]);
}
}
int main()
{
while(~scanf("%d",&n),n)
{
get_map();
floyd();
print();
}
return 0;
}