hdoj 1385 Minimum Transport Cost(floyd 记录最短路径)
来源:互联网 发布:最长公共子序列c语言 编辑:程序博客网 时间:2024/04/28 00:27
Minimum Transport Cost
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:
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
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
Source
Asia 1996, Shanghai (Mainland China)
#include<cstdio>#include<cstring>using namespace std;int n;int tax[111];int map[111][111];int path[111][111];void floyd(){ int temp; int k,i,j; for(i=1;i<=n;i++) for(j=1;j<=n;j++) path[i][j]=j; for(k=1;k<=n;k++) { for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { temp=map[i][k]+map[k][j]+tax[k]; if(temp<map[i][j]) { map[i][j]=temp; path[i][j]=path[i][k]; } else if(temp==map[i][j]) { if(path[i][j]>path[i][k]) path[i][j]=path[i][k]; } } } }}int main(){ int i,j; int temp; int s,e; while(scanf("%d",&n),n) { for(i=1;i<=n;i++) for(j=1;j<=n;j++) { scanf("%d",&temp); if(temp==-1) map[i][j]=11111111; else map[i][j]=temp; } for(i=1;i<=n;i++) scanf("%d",&tax[i]); floyd(); while(scanf("%d%d",&s,&e)!=-1) { if(s==-1&&e==-1) break; printf("From %d to %d :\n",s,e); printf("Path: %d",s); temp=s; while(temp!=e) { printf("-->%d",path[temp][e]); temp=path[temp][e]; } printf("\n"); printf("Total cost : %d\n\n",map[s][e]); } } return 0;}
0 0
- hdoj 1385 Minimum Transport Cost(floyd 记录最短路径)
- HDOJ 1385 Minimum Transport Cost (最短路 Floyd & 路径记录)
- HDOJ--1385--Minimum Transport Cost(最短路记录路径)
- hdu 1385 Minimum Transport Cost 最短路径floyd算法+路径记录 模板题
- hdoj 1385 Minimum Transport Cost 【floyd + 路径记录】
- hdoj Minimum Transport Cost 1385 (floyd++路径输出)
- hdu 1385 Minimum Transport Cost(floyd打印最小字典序的最短路径)
- HDU 1385Minimum Transport Cost(floyd+记录路径)
- hdu 1385 Minimum Transport Cost(floyd && 记录路径)
- hdu 1385 Minimum Transport Cost(最短路+记录路径)
- hdoj 1385 Minimum Transport Cost【最短路-->floyd】
- HDOJ-1385Minimum Transport Cost(记录路径且有点权的FLOYD)
- HDU1385 Minimum Transport Cost 【Floyd】+【路径记录】
- hdu 1385 Minimum Transport Cost--Floyd算法+点权值+记录路径
- hdu 1385 Minimum Transport Cost (Floyd 记录路径)
- HDU 1385 Minimum Transport Cost(floyd)(记录路径)
- zoj 1456 Minimum Transport Cost (Floyd+路径记录)
- HDOJ 1385 Minimum Transport Cost(dijkstar+字典路径||floyd+字典路径)
- 102. Binary Tree Level Order Traversal
- Codeforces 624A Save Luke
- 五分钟搞懂后缀数组!后缀数组解析以及应用(附详解代码)
- AIM Tech Round (Div. 2) C. Graph and String(二分图染色 | 贪心)
- 编程新手我觉得需要掌握的五个重要东西
- hdoj 1385 Minimum Transport Cost(floyd 记录最短路径)
- Ubuntu 学习笔记之——下载神器aria2
- Codeblocks GDB调试器设置与使用
- interface, abstract, class,
- 分享个最新的linux内核4.5-rc2(已经编译成deb包)
- WildFly 10发布了
- 各大Oj平台介绍
- Leetcode Ugly Number II
- 图 (并查集)1