Heavy Transportation

Heavy Transportation

 
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

题目大意:
把货物从城市1运往城市n,要使能运载的货物最多。有m条路,每一条路从城市a到城市b运货量为x

代码:


#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 1005
#define inf 0x3f3f3f
using namespace std;
int map[N][N],dis[N],vis[N];
int n;
int dij(int s,int e)
{
    memset(vis,0,sizeof(vis));
    memset(dis,0,sizeof(dis));
    for(int i=1;i<=n;i++)
            dis[i]=map[s][i];
    vis[s]=1;
    int ans,u;
    for(int i=1;i<=n;i++)
    {
       ans=0;
        for (int j=1;j<=n;j++)
            if (!vis[j]&&dis[j]>ans)
            {
                ans=dis[j];
                u=j;
            }
        vis[u]=1;
        for (int j=1;j<=n;j++)
        {
            if(map[u][j]>-1)
            dis[j]=max(dis[j],min(dis[u],map[u][j]));
        }
    }
    return dis[e];
}
int main()
{
    int t,m,a,b,x,k=1;
    scanf("%d",&t);
    while (t--)
    {
        memset(map,-1,sizeof(map));
        scanf("%d %d",&n,&m);
        for (int i=0;i<m;i++)
        {
            scanf("%d%d%d",&a,&b,&x);
            map[a][b]=map[b][a]=x;
        }
        printf("Scenario #%d:\n%d\n\n",k++,dij(1,n));
    }
    return 0;
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/chimchim04/article/details/79969969
个人分类: 最短路
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

Heavy Transportation

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭