HDU 1385 minimum transport cost)

This article describes how to create an undirected graph's Adjacent matrix and path. The extra cost required for each vertex is the first and the end. No extra cost. Calculate the shortest path between two points in the graph and print the minimum path of the Lexicographic Order.

It is required that the Floyd print path be used between multiple groups of points, which is also convenient for NEX [I] [J] to indicate the first path from the I point to the J point with the shortest path. If a node is added to the path after K, NEX [I] [J] should be updated to NEX [I] [k] Because K is required

#include<cstdio>#include<cstring>using namespace std;const int N = 100,INF=0x3f3f3f;int cost[N][N], tax[N], nex[N][N];int s, t, n;void floyd(){    int tmp;    for(int k = 1; k <= n; ++k)    for(int i = 1; i <= n; ++i)    for(int j = 1; j <= n; ++j)    {        tmp = cost[i][k] + cost[k][j] + tax[k];        if(cost[i][j] > tmp || (cost[i][j] == tmp && nex[i][j] > nex[i][k]))        {            nex[i][j] = nex[i][k];            cost[i][j] = tmp;        }    }}int main(){    while(scanf("%d", &n), n)    {        memset(nex,0,sizeof(nex));        for(int i = 1; i <= n; ++i)        {            for(int j = 1; j <= n; ++j)            {                scanf("%d", &cost[i][j]);                if(cost[i][j] < 0) cost[i][j]=INF;                else nex[i][j]=j;            }        }        for(int i = 1; i <= n; ++i)  scanf("%d", &tax[i]);        floyd();        while(scanf("%d%d", &s, &t), s > 0)        {            int k=s;            printf("From %d to %d :\nPath: %d", s, t, s);            while(k!=t) printf("-->%d", k=nex[k][t]);            printf("\nTotal cost : %d\n\n", cost[s][t]);        }    }    return 0;}

Minimum Transport Cost
Problem descriptionthese 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 shoshould be delivered from one city to another. the transportation extends 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, Please t for the source and the destination cities.

You must write a program to find the route which has the minimum cost.
 
Inputfirst 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:
 
Outputfrom 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

 
Sourceasia 1996, Shanghai (Mainland China)

HDU 1385 minimum transport cost)