hdu 1385 floyd的妙用 Minimum Transport Cost
2014-07-27 19:05
357 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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:
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
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.
[align=left]Input[/align]
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:
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
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 floyd 的妙用关键是 记录路径#include<stdio.h> int value[400]; int Map[400][400]; int path[400][400]; void floyd(int n) { int i,j,k; for(k=1;k<=n;k++) for(i=1;i<=n;i++) { if(k==i||Map[k][i]==-1) continue; for(j=1;j<=n;j++) { if(j==i||j==k||Map[k][j]==-1) continue; if(Map[i][j]==-1||Map[i][j]>Map[i][k]+Map[k][j]+value[k]) { Map[i][j]=Map[i][k]+Map[k][j]+value[k]; path[i][j]=path[i][k]; } if(Map[i][j]==Map[i][k]+Map[k][j]+value[k]&&path[i][j]>path[i][k]) path[i][j]=path[i][k]; } } } int main() { int n; int i,j; int x,y,z; while(scanf("%d",&n)!=EOF) { if(n==0) break; for(i=1;i<=n;i++) for(j=1;j<=n;j++) { scanf("%d",&Map[i][j]); path[i][j]=j; } for(i=1;i<=n;i++) scanf("%d",&value[i]); floyd(n); while(scanf("%d%d",&x,&y)!=EOF) { if(x==-1&&y==-1) break; z=x; printf("From %d to %d :\n",x,y); if(x==y) printf("Path: %d\n",x); else { printf("Path: %d",x); while(path[x][y]!=y) { printf("-->%d",path[x][y]); x=path[x][y]; } printf("-->%d\n",y); } printf ("Total cost : %d\n\n",Map[z][y]); } } return 0; }
相关文章推荐
- HDU 1385 Minimum Transport Cost(floyd)(记录路径)
- hdu 1385 ZOJ 1456 Minimum Transport Cost(经典floyd)
- HDU-1385-Minimum Transport Cost(floyd)
- hdu 1385(zoj 1456)Minimum Transport Cost(最短路,输出路径,Floyd实现)
- hdu 1385 Minimum Transport Cost Floyd
- hdu 1385 Minimum Transport Cost (Floyd 路径输出)
- HDU 1385 Minimum Transport Cost(Floyd+打印字典序最小路径)
- HDU - 1385 Minimum Transport Cost(floyd打印路径)
- HDU 1385 Minimum Transport Cost(Floyd)
- hdu 1385 Minimum Transport Cost(Floyd打印路径)
- hdu 1385 Minimum Transport Cost(floyd && 记录路径)
- HDU 1385-Minimum Transport Cost(floyd&&最小字典序)
- HDU 1385:Minimum Transport Cost【Floyd】
- hdu 1385 Minimum Transport Cost(最短路,floyd打印字典序路径)
- HDU 1385 Minimum Transport Cost(Floyd+打印字典序最小路径)
- hdu 1385 Minimum Transport Cost【floyd过】【最短路】
- HDU 1385 Minimum Transport Cost (Floyd求最短路径+记录字典序路径)
- hdu 1385 Minimum Transport Cost【floyd】
- HDU 1385 Minimum Transport Cost(Floyd 最短路 打印路径)
- hdu 1385 Minimum Transport Cost(floyd && 记录路径)