Heavy Transportation
来源:互联网 发布:双色球计算法27种 编辑:程序博客网 时间:2024/05/19 22:48
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.
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.
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.
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.
13 31 2 31 3 42 3 5
Scenario #1:4
根据题意以Dijkstra变形
#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<algorithm>#define inf 0x3f3f3f3f;using namespace std;int n,m,a,b,len,sum;int minj,temp;int dis[1005];int vis[1005];int g[1005][1005];int main(){ int t; int r=1; scanf("%d",&t); while(t--) { memset(vis,0,sizeof(vis)); memset(dis,0,sizeof(dis)); memset(g,0,sizeof(g)); for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(i==j) g[i][j]=0; else g[i][j]=-inf; } } scanf("%d%d",&n,&m); for(int i=1;i<=m;i++) { scanf("%d%d%d",&a,&b,&len); g[a][b]=g[b][a]=len; } for(int i=1;i<=n;i++) dis[i]=g[1][i]; vis[1]=1; for(int i=1;i<=n;i++) { minj=-inf; for(int j=1;j<=n;j++) { if(vis[j]==0&&dis[j]>minj) { minj=dis[j]; temp=j; } } vis[temp]=1; for(int j=1;j<=n;j++) { if(vis[j]==0) { //min(dis[temp],g[temp][j])求得是这条路中的最小权值/再求此中的最大值 dis[j]=max(dis[j],min(dis[temp],g[temp][j])); } } } printf("Scenario #%d:\n%d\n\n",r++,dis[n]); }}
阅读全文
0 0
- Heavy Transportation
- Heavy Transportation
- Heavy Transportation
- Heavy Transportation
- Heavy Transportation
- Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- Heavy Transportation (POJ1797)
- poj_1797 Heavy Transportation
- poj 1797 Heavy Transportation
- poj1797 - Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- 关于eclipse的debug模式,没有从自己定义的断点开始,而从一些java类开始的
- 基于Android和PHP图片分享系统(二):软件需求说明书(部分欠缺)
- 机器学习(4)—— Adaboost学习
- 16进制与10进制的相互转换
- 解释型语言和编译型语言的区别
- Heavy Transportation
- node中的exports和module.exports
- kmeans算法(python实现)
- 能强DRS.Technologies.Orca3D.v1.4.20170518.X64
- JavaScript机器学习之线性回归
- php配置php-fpm启动参数及配置详解
- maven使用filter动态配置项目
- 一只青蛙一次可以跳上1级台阶,也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
- 学习Linux-4.12内核网路协议栈(0)——前言