POJ1797Heavy Transportation 最短路径dijkstra算法变形

Heavy Transportation

Time Limit: 3000MS Memory Limit: 30000K
Total Submissions: 53991 Accepted: 13717

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

问题连接

问题描述

输入案例数。每组案例都输入城市数n，路线数m，再输入m行3个整数，分别代表道路的起点，终点和能通过的最大重量。
要求求出每个案例从起点1到终点n的最大载运量，并以题目的格式输出。

问题分析

与青蛙约会问题( http://poj.org/problem?id=2253 )相似。都是最短路的变形，松弛操作中的更新长度换成了能运载的最大重量，也就是借助一个中间点的时候取两段路的最大载运量的小值与直接连接的时候的最大运载量比较，取大的那个。
如：
1 6 2；2 4 3；1 5 3；表示从1到2最大能载6的重量，从2到3最大能运载4的重量，从1到3最大能运载5的重量。所以选择从1直接到3这条路，也就是不更新。
dijkstra算法直接就通过了，floyd算法一直超时，时间复杂度太高了。

c++程序如下

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;

const int N = 1005;
const int inf = 0x3f3f3f3f;

int n, m;
int map[N][N];
int dist[N];
bool vis[N];

int min(int x, int y){ return x < y ? x : y; }
int max(int x, int y){ return x > y ? x : y; }
void reset()//初始化
{
	for (int i = 1; i <= n; i++)
	for (int j = i; j <= n; j++)
	if (i == j) map[i][j] = inf;//不移动，可以不管载的重量，或者说取inf的最大载取量
	else map[i][j] = map[j][i] = 0;//最大载取量为0
}
void dijkstra(int start)
{
	int i, j, ans, temp;
	for (i = 1; i <= n; i++)
	{
		vis[i] = 0;
		dist[i] = map[start][i];
	}
	vis[start] = 1;
	for (i = 1; i < n; i++)
	{
		ans = 0;
		for (j = 1; j <= n; j++)//找出最大的dist
			if (!vis[j] && ans < dist[j])
			{
				ans = dist[j];
				temp = j;
			}
		if (ans == 0) break;
		vis[temp] = 1;
		for (j = 1; j <= n; j++)
			dist[j] = max(dist[j], min(dist[temp], map[temp][j]));
	}
}
int main()
{
	int t, time;
	scanf_s("%d", &t);
	for (time = 1; time <= t; time++)
	{
		scanf_s("%d %d", &n, &m);
		reset();
		int s, e, w;
		while (m--)
		{
			scanf_s("%d %d %d", &s, &e, &w);
			map[s][e] = map[e][s] = w;
		}
		dijkstra(1);
		printf("Scenario #%d:\n%d\n\n", time, dist[n]);
	}
	return 0;
}