标签：customer streets weight Hugo place 英语翻译 1.23 line
题目来源：http://noi.openjudge.cn/ch0403/799/
重点词汇：
crane ：n.重点词汇
capacity： n.能力，容量
assume ：v.假设
triple：adj.三倍的
799:Heavy Transportation
重型运输
- 总时间限制:
- 3000ms
- 内存限制:
- 65536kB
- 描述
- 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.
背景： - Hugo Heavy 非常高兴。在他的 Cargolifter 项目崩溃之后，他现在可以扩展他的商业。但是他需要一个聪明的人来告诉他是否真的只有一条路可以从他的顾客建造的巨型钢起重机的地方到所有街道都可以承受重量的地方。
- 幸运的是他已经制定了一个城市平面图，包含所有的街道和桥以及所有允许的承重能力。不幸的是他不知道怎么找出最大承重能力，以便告诉顾客起重机的重量。但是你肯定知道。
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. - 给你城市的平面图，通过交叉路口的街道（包含承重限制）来描述，用1到n来编号。你的任务是找出从路口1（Hugo 所在的位置）到路口n（这顾客的位置）可以通过的最大重量。你可以假设至少有一条路径，所有街道可以双向通行
- 输入
- 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.
- 第一行包含场景的数量（城市规划）。 对于每个城市，街道交叉口的数量 n (1 <= n <= 1000) 和街道数量 m 在第一行给出。 以下 m 行包含整数的三元组，指定街道的起点和终点交叉口以及最大允许权重，其中（最大允许权重）为正数且不大于 1000000。每对交叉口之间最多有一条街道。
- 输出
- 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.
- 每个场景的输出都以包含“场景 #i:”的行开头，其中 i 是场景的编号，从 1 开始。然后打印一行，其中包含 Hugo 可以运输给客户的最大允许重量。 用空行终止场景的输出。
- 样例输入
-
1 3 3 1 2 3 1 3 4 2 3 5
- 样例输出
-
Scenario #1: 4
- 来源
- TUD Programming Contest 2004, Darmstadt, Germany
标签：customer,streets,weight,Hugo,place,英语翻译,1.23,line 来源： https://www.cnblogs.com/qq-2556146261/p/15837533.html
本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享； 2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关； 3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关； 4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除； 5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。