Minimum Transport Cost HDU - 1385 （floy）

 我不会。。。。。。。。。。。。。。。

这题用Floy写比较简单，而且path的用法比较好。

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

#include<stdio.h>
#include<string.h>
#define maxn 1000
const int inf=0x3f3f3f3f;
int mp[maxn][maxn];
int val[maxn];
int dis[maxn][maxn];
int path[maxn][maxn];
void floy(int n)
{
	for(int k=1;k<=n;k++)
	{
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				if(dis[i][j]>dis[i][k]+dis[k][j]+val[k])
				{
					dis[i][j]=dis[i][k]+dis[k][j]+val[k];//注意这里了一个中间节点val[k] 
					path[i][j]=path[i][k];//这里的path[i][j]改变路径经过k最终能够到达j 
				}
				else if(dis[i][j]==dis[i][k]+dis[k][j]+val[k])
				{
					if(path[i][j]>path[i][k])//寻找字典序最小的 
					{
						path[i][j]=path[i][k];
						dis[i][j]=dis[i][k]+dis[k][j]+val[k];//注意更新 
					}
				}
			}
		}
	}
}
void print_path(int u,int v)
{
	if(u==v)
	{
		printf("%d\n",u);
		return ; 
	}
	int k=path[u][v];
	printf("%d-->",u);
	print_path(k,v);
}


int main()
{
    int N;
	while(scanf("%d",&N)&&N!=0)
	{
		for(int i=1;i<=N;i++)
		{
			for(int j=1;j<=N;j++)
			{
				scanf("%d",&dis[i][j]);
				if(dis[i][j]==-1)
				{
					dis[i][j]=inf;
				}
				path[i][j]=j;//path打印路径的方法很好没见过。。。
				//path[i][j]=j 表示i-->j;
				// 例如：path[i][j]=w,path[w][j]=k,path[k][j]=j   表示i-->w-->k-->j
			}
		}
		for(int i=1;i<=N;i++)
		{
			scanf("%d",&val[i]);
		}
		floy(N);
		int u,v;
		while(scanf("%d%d",&u,&v)&&(u!=-1&&v!=-1))
		{
		int	cost=dis[u][v];
			if(u==v)//起点和终点相等时特殊处理 
			{
				printf("From %d to %d :\n",u,v);
				printf("Path: %d\n",u);
				printf("Total cost : %d\n\n",cost);
				continue;				
			}
			printf("From %d to %d :\n",u,v);
			printf("Path: ");
			print_path(u,v);
			printf("Total cost : %d\n\n",cost);
			
		}
	}
    return 0;
}