Heavy Transportation

最新推荐文章于 2019-09-08 20:18:03 发布

进击的木头

最新推荐文章于 2019-09-08 20:18:03 发布

阅读量907

点赞数

CC 4.0 BY-SA版权

分类专栏：最短路

本文链接：https://blog.youkuaiyun.com/qq_40510246/article/details/80152185

最短路专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一个寻找从起点到终点的最大运输重量的问题。给定城市计划中各街道及其重量限制，任务是确定从指定起点到终点可以运输的最大允许重量。文章提供了问题描述、输入输出格式及示例，并附带了解决该问题的C++代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Sample Output

Scenario #1:
4

PS：

这道题目要求的是从1到N各个路径最小值的最大值，即d[y]=max(d[y],min(d[x],m[x][y])).

代码：

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
const int M=1005;
int t,n,m,cas=0;
int mmp[M][M],vis[M],d[M];
void dijk()
{
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++)
        d[i]=mmp[1][i];
    d[1]=0;
    vis[0]=1;
    for(int i=1;i<=n;i++)
    {
        int u=-1,m=0;
        for(int j=1;j<=n;j++)
        {
            if(!vis[j]&&d[j]>m)
            {
                m=d[j];
                u=j;
            }
        }
        vis[u]=1;
        for(int i=1;i<=n;i++)
        {
            if(mmp[u][i])
                d[i]=max(d[i],min(d[u],mmp[u][i]));
        }
    }
}
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        memset(mmp,0,sizeof(mmp));
       int u,v,w;
       scanf("%d%d",&n,&m);
       for(int i=1;i<=m;i++)
       {
           scanf("%d%d%d",&u,&v,&w);
           mmp[u][v]=mmp[v][u]=w;
       }
       dijk();
       if(cas) puts("");
       printf("Scenario #%d:\n",++cas);
       printf("%d\n",d[n]);
    }
}