hdu 1385 Minimum Transport Cost Floyd

最新推荐文章于 2021-03-08 11:01:14 发布

原创最新推荐文章于 2021-03-08 11:01:14 发布 · 433 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#acm #hdu #Floyd #最短路

本文探讨了在HDU 1385问题中，通过比较使用Dijkstra算法与Floyd算法解决路径查找问题的过程与效率提升。详细介绍了如何使用Floyd算法进行优化，并提供了相应的代码实现与实例解析。

In this problem,First I use dijkstra to solve it.But WA defeated me.I finally use Flyod.

The portal:http://acm.hdu.edu.cn/showproblem.php?pid=1385

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAXN 1005
const int INF = 0x3f3f3f3f;

int cost[MAXN][MAXN];
int route[MAXN][MAXN];
int power[MAXN];

void Input(){
	int n;
	while(scanf("%d",&n),n){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				scanf("%d",cost[i]+j);
				if(cost[i][j]==-1){
					cost[i][j] = INF;				
				}
				route[i][j] = j;	
			}			
		}
		for(int i=1;i<=n;i++){
			scanf("%d",power+i);			
		}
		for(int k=1;k<=n;k++){
			for(int i=1;i<=n;i++){
				for(int j=1;j<=n;j++){
					int temp = cost[i][k] + cost[k][j] + power[k] ;	
					if(temp < cost[i][j]){
						cost[i][j] = temp;
						route[i][j] = route[i][k];					
					}				
					else if(temp == cost[i][j]){
						if(route[i][j] > route[i][k]){
							route[i][j] = route[i][k];						
						}					
					}
				}
			}				
		}
		int g,h;
		while(scanf("%d %d",&g,&h),g+h+2){
	        printf("From %d to %d :\n",g,h);  
            printf("Path: %d",g);  
            int temp=g;  
            while(temp!=h)  
            {  
                printf("-->%d",route[temp][h]);  
                temp=route[temp][h];  
            }  
            printf("\n");  
            printf("Total cost : %d\n\n",cost[g][h]);   	
		}
	}
}

int main(){
	//freopen("a.in","r",stdin);
	Input();
	return 0;
}