POJ 1797Heavy Transportation
来源:互联网 发布:lda模型 矩阵分解 编辑:程序博客网 时间:2024/06/04 20:13
Description
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
Output
Sample Input
13 31 2 31 3 42 3 5
Sample Output
Scenario #1:4
题意:
无向图,权值代表两个城市的道路所能承受的最大载重量,询问城市1到城市N可以通过的最大载重量是多少?
题目解析:
最短路的变形,Floyd算法指定超时。可以采用Dijkstra算法或者SPFA算法,只是在数组的初始化和判断条件上有变化。首先用一个data数组存两两道路的载重量,不存在的初始化为0,用Distance数组表示城市1到各个城市的最大载重,在跑SPFA算法时初始的Distance[1]设为无穷大,用pin数组作为标记判断是否在队列中。Distance[m]表示城市1到m的最大载重量,data[m][i]代表城市m到i的最大载重量,Distance[i]表示城市1到i的最大载重量,如果Distance[m]与data[m][i]均大于Distance[i],则更新Distacne[i]为两者中的较小者。
AC代码:
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <climits>
#include<iomanip>
using namespace std;
const int MAXN=1e3+10;
const int maxx=INT_MAX;
bool vis[MAXN];
int Distance[MAXN];
int N, M;
int data[MAXN][MAXN];
void SPFA()
{
queue<int>Q;
Distance[1]=maxx;
vis[1]=true;
Q.push(1);
while(!Q.empty())
{
int m=Q.front();
Q.pop();
vis[m]=false;
for(int i=1; i<=N; i++)
{
if(min(Distance[m],data[m][i])>Distance[i])
{
Distance[i]=min(Distance[m],data[m][i]);
if(!vis[i])
{
Q.push(i);
vis[i]=true;
}
}
}
}
}
int main()
{
int T;
while(cin>>T)
{
for(int t=1; t<=T; t++)
{
cin>>N>>M;
memset(data,0,sizeof(data));
memset(vis,false,sizeof(vis));
memset(Distance,0,sizeof(Distance));
int a, b, c;
while(M--)
{
scanf("%d%d%d",&a,&b,&c);///一定要用scanf读,cin极易超时。
data[a][b]=data[b][a]=c;
}
SPFA();
cout<<"Scenario #"<<t<<':'<<endl;
cout<<Distance[N]<<endl<<endl;
}
}
return 0;
}
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- Poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ-1797-Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- js css3仿ios toast提示。
- C++排序算法之计数排序
- 微信公众平台开发之模板消息(Java)
- J2EE for SpringMvc 中JSP在idea里不能够提示Bootstrap的问题解决
- JS事件10
- POJ 1797Heavy Transportation
- AngularJs 指令directive之controller,link,compile
- UVA 12086 Potentiometers(树状数组|| 线段树单点更新)
- 练习7
- 哪有python入门经典教程资源分享?
- git reset
- 剑指offer:最小的K个数
- git 使用
- 【问题汇总】开发中常见问题的解决办法