HDU-1385-Minimum Transport Cost(floyd)
来源:互联网 发布:linux引导windows 编辑:程序博客网 时间:2024/06/07 23:00
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 : 17
题意:给n个城市,输出任意一个城市到另一个城市的最小价格,其中通过的城市要收税,如果价值一样的输出最小字典序的路径。
思路:用path二维数组保存路径。
#include <stdio.h>#define INF 99999999#define MAX 35int path[MAX][MAX],map[MAX][MAX],tax[MAX];int main(){ int n,i,j,k,len; while(~scanf("%d",&n) && n) { for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { scanf("%d",&k); if(k==-1) map[i][j]=INF; else map[i][j]=k; path[i][j]=j;//初始化路径 } } for(i=1;i<=n;i++) scanf("%d",&tax[i]); for(k=1;k<=n;k++) { for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { len=map[i][k]+map[k][j]+tax[k]; if(len<map[i][j])//如果价值比原来的小 { map[i][j]=len; path[i][j]=path[i][k];//跟新路径 } else if(len==map[i][j] && path[i][k]<path[i][j])//如果价值相等并且字典序比原来的小 { path[i][j]=path[i][k];//跟新路径 } } } } while(scanf("%d%d",&i,&j) && i!=-1) { printf("From %d to %d :\nPath: ",i,j); k=i; while(k!=j) { printf("%d-->",k); k=path[k][j]; } printf("%d\nTotal cost : %d\n\n",j,map[i][j]); } }}
52 0
- 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 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&&最小字典序)
- 【直方图面积】Maximal Rectangle
- oracle超出了表空间users的空间限量问题
- 设计模式之策略模式
- Cinder概述(1) 20140405
- SateliteMenu的使用
- HDU-1385-Minimum Transport Cost(floyd)
- SecureCRT登录执行
- 如何安全退出已调用多个Activity的Application?
- TCP/IP协议栈与数据报封装 (802.3 Ethernet 以太网 802.11 WLAN 无线网 )
- SQL高级查询
- PS 图像调整算法——亮度调整
- ContentProvider实现数据共享
- 图像处理:基础模板、卷积运算
- 微软2014编程之美大赛测试样题一