Heavy Transportation
Description
Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.
Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's place). You may assume that there is at least one path. All streets can be travelled in both directions.
Input
The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.
Output
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for the scenario with a blank line.
Sample Input
1 3 3 1 2 3 1 3 4 2 3 5
Sample Output
Scenario #1: 4
问题链接:http://poj.org/searchproblem?field=source&key=TUD+Programming+Contest+2004
实在看不懂,参考别人博客:https://blog.csdn.net/w13884794538/article/details/81258840
题目大意:每条路上可以搭载的货物量有上限,问要走到终点,可以运载的最大载物量
解题思路:寻找每条可能行的通的路中,最小的那条边(因为一条路中的允许重量取决于最小值),再把每条路中最小的这条边中取最大的,bellman-ford和djiska和floyd都可以。(我看不懂呀!)、
以下是完整代码:
#include <iostream>
#include <algorithm>
using namespace std;
int n, m;
int ma[1003][1003];
int v[1003];
int dis[1003];
void Dijkstra()
{
for (int i = 1; i <= n; i++)
{
v[i] = 0;
dis[i] = ma[1][i];
}
dis[1] = 0;
v[1] = 1;
int point, minx;
for (int i = 1; i <= n; i++)
{
point = i;
minx = -1;//初始值最小
for (int j = 1; j <= n; j++)
{
if (v[j] == 0 && minx<dis[j])
{
point = j;
minx = dis[j];//寻找最大的边值(承受重量最大)
}
}
v[point] = 1;
for (int j = 1; j <= n; j++)//更新
{
if (v[j] == 0 && dis[j]<min(ma[point][j], dis[point]))
dis[j] = min(ma[point][j], dis[point]);
}
}
cout << dis[n] << "\n\n";//输出最小的承受重量
}
int main()
{
int t;
cin >> t;
int ans = 1;
while (t--)
{
memset(ma, 0, sizeof(ma));
cin >> n >> m;
for (int i = 0; i < m; i++)
{
int a, b, c;
cin >> a >> b >> c;
ma[a][b] = ma[b][a] = c;
}
cout << "Scenario #" << ans << ":\n";
ans++;
Dijkstra();
}
}