hdu 1385 floyd的妙用 Minimum Transport Cost
来源:互联网 发布:ipython for windows 编辑:程序博客网 时间:2024/06/01 20:57
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.
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:
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.
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
50 3 22 -1 43 0 5 -1 -122 5 0 9 20-1 -1 9 0 44 -1 20 4 05 17 8 3 11 33 52 4-1 -10
Sample Output
From 1 to 3 :Path: 1-->5-->4-->3Total cost : 21From 3 to 5 :Path: 3-->4-->5Total cost : 16From 2 to 4 :Path: 2-->1-->5-->4Total cost : 17floyd 的妙用关键是 记录路径#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;}
0 0
- hdu 1385 floyd的妙用 Minimum Transport Cost
- 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 1385Minimum 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&&最小字典序)
- JSON解析及省市区在tableView上的显示
- C#中实现类似QQ的气泡提示
- JavaLearning:方法的覆写
- phpmailer的用法
- C#保持RichTextBox内容在底部
- hdu 1385 floyd的妙用 Minimum Transport Cost
- C# 局域网内socket通信 TCP
- UVA 644 (暑假-字符串(2)-E - Immediate Decodability)
- Memcached哈希性能优化(三)
- 从App Store上获取已经上架的App版本信息
- hdu 2795
- aidl自定义类型
- 编程初学二 我的crash原因总结 持续更新中。。。。
- point 小练习题 一