uva10099(最长路问题Floyd)

题目的意思就是你要带游客从一个城市到另一个城市,但是路上每条路都有人数限制.问你最少需要几趟.

首先要找到一条能运最多人的路,能运最多人就这条路上权值最小的..

然后找到一趟最多运几个人,还要减掉1 ,因为导游永远占一个位置.

Floyd算法, 裸过.

AC代码:

#include<stdio.h>
const int  N = 105;
int d[N][N];
int n,r;
int main () {
	int a,b,c;
	int cas = 1;
	while (scanf("%d%d",&n,&r) && n) {
		for (int i = 0 ; i <= n ;i++) {
			for (int j = 0 ; j <= n ;j++) {
				d[i][j] = 0;
			}
		}
		for (int i = 0 ; i < r ;i++) {
			scanf("%d%d%d",&a,&b,&c);
			d[a][b] = c;
			d[b][a] = c;
		}
		for (int k = 1 ; k <= n ;k++) {
			for (int i = 1 ;i <= n ;i++) {
				for (int j = 1 ; j <= n ;j++) {
					if(d[i][k] && d[k][j]) {
						int m = d[i][k] < d[k][j] ? d[i][k] : d[k][j];
						if (m > d[i][j])
							d[i][j] = m;
					}
				}
			}
		}
		scanf("%d%d%d",&a,&b,&c);
		int res;
		if (c % (d[a][b] - 1) == 0)
			res = c / (d[a][b] - 1);
		else
			res = c / (d[a][b] - 1) + 1;
		printf("Scenario #%d\n",cas++);
		printf("Minimum Number of Trips = %d\n\n",res);
	}
}