题目:1797–Heavy Transportation
参考博客
思路:题目求从1号点到到N号点可以运输的最大重量是多少,相当于是求从1 - N的路径中,每条路径中的权值最小值的最大值。
样例:从1 - 3有两条路径
1、1 --> 3 dist[3] = 4
2、1 --> 2 --> 3 dist[3] = 3
因此结果是4;
在求最短路的时候用的dist数组一般存的是从起点到第i个点的最短距离,这里我们用来存从起点到第i个点的最小边权(重量)
假如从第i 个点 到第j个点,松弛条件:dist[j] < min(dist[i] , w),w表示从i到j的权值,当满足条件时我们把边就进行更新;
由于题目保证存在结果,因此将所有的边都更新完后,dist[n]就是结果。
spfa算法:
#include <iostream>
#include <cstring>
using namespace std;
const int N = 1010, M = 2000010;
int n,m;
int h[N],w[M],e[M],ne[M],idx;
int dist[N],q[N];
bool st[N];
void add(int a,int b,int c){
e[idx] = b; w[idx] = c; ne[idx] = h[a]; h[a] = idx++;
}
void spfa(){
memset(dist,0,sizeof dist);
memset(st,0,sizeof st);
int hh = 0, tt = 1;
q[0] = 1;
dist[1] = 0x3f3f3f3f;
while(hh != tt){
int t = q[hh++];
if(hh == N) hh = 0;
st[t] = false;
for(int i = h[t]; ~i; i = ne[i]){
int j = e[i];
if(dist[j] < min(dist[t],w[i])){
dist[j] = min(dist[t],w[i]);
if(!st[j]){
q[tt++] = j;
if(tt == N) tt = 0;
st[j] = true;
}
}
}
}
}
int main(){
int T;
scanf("%d",&T);
for(int k = 1; k <= T; k++){
scanf("%d%d",&n,&m);
memset(h,-1,sizeof h);
idx = 0;
for(int i = 0; i < m; i++){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
add(a,b,c); add(b,a,c);
}
spfa();
printf("Scenario #%d:\n",k);
printf("%d\n\n",dist[n]);
}
return 0;
}
dijkstrea算法:
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
typedef pair<int,int> PII;
const int N = 1010, M = 2000010;
int n,m;
int h[N],w[M],e[M],ne[M],idx;
int dist[N];
bool st[N];
void add(int a,int b,int c){
e[idx] = b; w[idx] = c; ne[idx] = h[a]; h[a] = idx++;
}
void dijkstra(){
memset(dist,0,sizeof dist);
memset(st,0,sizeof st);
priority_queue<PII,vector<PII>,less<PII> > q;
q.push(make_pair(0x3f3f3f3f,1));
dist[1] = 0x3f3f3f3f;
while(q.size()){
PII t = q.top(); q.pop();
int u = t.second, distance = t.first;
if(st[u]) continue;
st[u] = true;
for(int i = h[u]; ~i; i = ne[i]){
int j = e[i];
if(dist[j] < min(distance,w[i])){
dist[j] = min(distance,w[i]);
q.push(make_pair(dist[j],j));
}
}
}
}
int main(){
int T;
scanf("%d",&T);
for(int k = 1; k <= T; k++){
scanf("%d%d",&n,&m);
memset(h,-1,sizeof h);
idx = 0;
for(int i = 0; i < m; i++){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
add(a,b,c); add(b,a,c);
}
dijkstra();
printf("Scenario #%d:\n",k);
printf("%d\n\n",dist[n]);
}
return 0;
}