POJ - 1797—最短路

56 阅读 0 评论 37 点赞

我是靠谱客的博主漂亮台灯，最近开发中收集的这篇文章主要介绍POJ - 1797—最短路，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

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的最大权值
解题思路:最短路去维护dis数组

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,m;
int book[2000];
int dis[2000];
int a[2000][2000];
int k=1;
void dijk()
{
int minn,u;
for(int i=1;i<=n;i++)
dis[i]=a[1][i];
dis[1]=0;
book[0]=1;
for(int i=1;i<=n;i++)
{
minn=0;
for(int j=1;j<=n;j++)
{
if(dis[j]>minn&&book[j]==0)
{
minn=dis[j];
u=j;
}
}
book[u]=1;
for(int j=1;j<=n;j++)
{
dis[j]=max(dis[j],min(dis[u],a[u][j]));
}
}
printf("Scenario #%d:n",k++);
printf("%dnn",dis[n]);
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(a,0,sizeof(a));
memset(book,0,sizeof(book));
scanf("%d%d",&n,&m);
int x,y,z;
for(int i=0;i<m;i++)
{
scanf("%d%d%d",&x,&y,&z);
a[x][y]=a[y][x]=z;
}
dijk();
}
return 0;
}