zoukankan      html  css  js  c++  java
  • HDU 1385 Minimum Transport Cost

    描述

    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.

    输入

    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:

    输出

    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.

    样例输入

    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
    

    样例输出

    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

    题目来源

    Asia 1996

     

     floyd变形+记录路径~~~

    map[i][k]+map[k][j]+tax[k]<map[i][j]时更新map[i][j]

    要注意的是当两点路径相等时记录字典序比较小的结点

    则next[i][k]<next[i][j] 时更新next[i][j]

    #include <stdio.h>
    #define MAXN 205
    #define inf 0x3f3f3f3f
    int main(int argc, char *argv[])
    {
        int n;
        int map[MAXN][MAXN];
        int next[MAXN][MAXN];
        int tax[MAXN];    
        while(scanf("%d",&n)!=EOF && n){
            for(int i=1; i<=n; i++){
                for(int j=1; j<=n; j++){
                    scanf("%d",&map[i][j]);
                    if(map[i][j]==-1){
                        map[i][j]=inf;
                    }else{
                        next[i][j]=j;
                    }
                }
            }    
            for(int i=1; i<=n; i++){
                scanf("%d",&tax[i]);
            }            
            for(int k=1; k<=n; k++){
                for(int i=1; i<=n; i++){
                    for(int j=1; j<=n; j++){
                        if(i==j||j==k)continue;
                        if(map[i][k]!=inf && map[k][j]!=inf ){    
                            if(map[i][k]+map[k][j]+tax[k]<map[i][j]){
                                map[i][j]=map[i][k]+map[k][j]+tax[k];
                                next[i][j]=next[i][k];                            
                            }else if(map[i][k]+map[k][j]+tax[k]==map[i][j]
                                && next[i][k]<next[i][j]){
                                next[i][j]=next[i][k];
                            }
                        }
                    }
                }
            }
            int u,v,t;
            while(scanf("%d %d",&u,&v)){
                if(u==-1&&v==-1)break;        
                printf("From %d to %d :
    ",u,v);        
                if(u==v){
                    printf("Path: %d
    ",u);
                }else{
                    printf("Path: %d",u);
                    t=u;
                    while(next[t][v]!=v){
                        printf("-->%d",next[t][v]);
                        t=next[t][v];
                    }
                    printf("-->%d
    ",v);                
                }
                printf("Total cost :%d
    
    ",map[u][v]);        
            }
        }
        return 0;
    }
  • 相关阅读:
    Apache-Tomcat 和 Apache-Maven配置
    php版本CKFinder3.4.4自定义上传文件位置
    php版本CKEditor 4和CKFinder安装及配置
    windows10 卸载 Docker 和 DockerNAT
    faker php测试数据库生成2
    faker php测试数据库生成
    我的php.ini上传文件配置
    同一个网址电脑手机访问显示不同内容思路
    mysql where 条件中的字段有NULL值时的sql语句写法
    Chrome导出书签瘦身,去除ADD_DATE和ICON
  • 原文地址:https://www.cnblogs.com/chenjianxiang/p/3533601.html
Copyright © 2011-2022 走看看