【POJ 1797】 Heavy Transportation 最短路变型 Dijkstra堆优化

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的路径有很多，每条路径都有权值最小的一条边，现在我要求所有路径中最小边集合的最大值

思路（最短路模板）：

设d[n]即为1->n中所有路径中最短边集合的最大值，而d[n]可以由d[v] 和 w[v][n]转移得到，其中d[v]是1->v的所有路径最短边的最大值，w[v][n]是连接v和n的一条边。那么在v和n联通的时候，会产生两条新的边，分别是上面说的1->v的边和v->n的边，因为要取路上的最短值，所以这两条边选一条最小的当做这个路径的代表，去和原来的d[n]，也就是其他路径上产生的最短边集合最大值进行对比，如果比d[n]大就更新。核心的思路就是这样（表达有点拗口）。然后套用Dijkstra的模板即可。注意除了d[1]要赋值为一个极大值（使得第一步的取最小边能够进行），其他的d全赋值为-1 。 详见代码

#include <iostream>
#include <cstdio>
#include <cmath>
#include  <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#define maxn 1500
using namespace std;
int d[maxn];
vector<pair<int, int > >D[maxn];
int vis[maxn];
int n, m;
int inf = 0x3f3f3f3f;

void init()
{
	for (int i = 1; i <= n; i++)
		vis[i] = 0, d[i] = -1, D[i].clear();
}

void Dijkstra()
{
	priority_queue < pair<int, int >, vector<pair<int, int > >, less<pair<int, int> > > q;
	d[1] = inf;
	q.push(make_pair(inf, 1));
	while (!q.empty())
	{
		int now = q.top().second;
		q.pop();
		if (vis[now]) continue;
		vis[now] = 1;
		for (int i = 0; i < D[now].size(); i++)
		{
			int v = D[now][i].first;
			
			if (d[v] < min( D[now][i].second , d[now] )&& !vis[v])
			{
			
				d[v] = min(D[now][i].second, d[now]);	//printf("%d %d\n", v, d[v]);
				q.push(make_pair(D[now][i].second, v));
			}
		}
	}

}

inline int read()
{
	int x = 0;
	char ch = getchar();
	while (ch < '0' || ch>'9') ch = getchar();
	while (ch >= '0' && ch <= '9') x =(x << 3) + (x << 1) + ch - '0', ch = getchar();
	return x;
}

int main()
{
	ios::sync_with_stdio(false);
	int num = 1;
	int kase;
	scanf_s("%d", &kase);
	while (kase--)
	{
			n = read();
			m = read();
			init();
			for (int i = 1; i <= m; i++)
			{
				int x, y, z;
				x = read(), y =read() , z = read();
				D[x].push_back(make_pair(y, z));
				D[y].push_back(make_pair(x, z));
			}
			Dijkstra();
			printf("Scenario #%d:\n", num++);
			printf("%d\n\n", d[n]);
	}
}