zoukankan      html  css  js  c++  java
  • 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
    


    题解:求全部1到n的路径中能运的最大值。用djistra算法,每次找最大的一个,然后更新该点到其它点的最大值。(有的题目是求全部路径中的最大值)。


    djistra:

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    
    using namespace std;
    
    const int INF = 0x3fffffff;
    
    int map[1003][1003];
    bool visited[1003];
    int d[1003];  //保存1到该点路径中运输量的最大值 
    
    int min(int a,int b)
    {
    	return a > b ? b : a;
    }
    
    void prim(int n)
    {
    	memset(visited,false,sizeof(visited));
    	for(int i = 1;i <= n;i++)
    	{
    		d[i] = map[1][i];
    	}
    	d[1] = INF;
    	visited[1] = true;
    	for(int i = 1;i < n;i++)
    	{
    		int m = 0;
    		int k;
    		for(int j = 1;j <= n;j++)
    		{
    			if(!visited[j] && m < d[j])  //每次找到j点运输量最大的一个 
    			{
    				m = d[j];
    				k = j;
    			}
    		}
    		if(m == 0)
    		{
    			break; 
    		}
    		visited[k] = true;
    		for(int j = 1;j <= n;j++)
    		{
    			if(!visited[j] && d[j] < map[k][j] && d[j] < d[k])  
    			{    //表示1到j的路径的运输量的最大值被1->k->j代替,由于该路径的大 
    				d[j] = min(d[k],map[k][j]);
    			}
    		}
    	}
    }
    
    int main()
    {
    	int ncase;
    	cin>>ncase;
    	int t = 1;
    	while(ncase--)
    	{
    		int n,m;
    		scanf("%d%d",&n,&m);
    		for(int i = 1;i <= n;i++)
    		{
    			for(int j = 1;j <= n;j++)
    			{
    				if(i == j)
    				{
    					map[i][j] = INF;  //自己运输到自己 
    				}
    				else
    				{
    					map[i][j] = 0; 
    				}
    			}
    		}
    		for(int i = 0;i < m;i++)
    		{
    			int u,v,w;
    			scanf("%d%d%d",&u,&v,&w);
    			map[u][v] = map[v][u] = w;
    		}
    		
    		prim(n);
    		printf("Scenario #%d:
    ",t++);
    		printf("%d
    
    ",d[n]);
    	}
    	
    	
    	return 0;
    }


  • 相关阅读:
    SkylineGlobe 7.0.1 & 7.0.2版本Web开发 如何实现对三维模型和地形的剖切展示
    SkylineGlobe 7.0.1 & 7.0.2版本Web开发 如何正确使用三维地图控件和工程树控件
    SkylineGlobe TerraExplorer for Web 7.1.0版本 接口示例
    如何解决一个从SkylineGlobe5版本升级到7版本遇到的小问题
    Cesium如何通过addImageryProvider方法加载SkylineGlobe Server发布的WMS服务
    SkylineGlobe7.0.1版本 支持SQLite(*.sqlite;*.db)数据库
    SkylineGlobe7.0.1版本 通过鼠标左右平移模型对象
    显示器文字发虚的一种原因
    HttpClient + IIS压缩动态内容
    C# Async Await 注意事项
  • 原文地址:https://www.cnblogs.com/cxchanpin/p/7074126.html
Copyright © 2011-2022 走看看