POJ1125 Stockbroker Grapevine(spfa枚举)
Description
Unfortunately for you, stockbrokers only trust information coming from their "Trusted sources" This means you have to take into account the structure of their contacts when starting a rumour. It takes a certain amount of time for a specific stockbroker to pass the rumour on to each of his colleagues. Your task will be to write a program that tells you which stockbroker to choose as your starting point for the rumour, as well as the time it will take for the rumour to spread throughout the stockbroker community. This duration is measured as the time needed for the last person to receive the information.
Input
Each person is numbered 1 through to the number of stockbrokers. The time taken to pass the message on will be between 1 and 10 minutes (inclusive), and the number of contacts will range between 0 and one less than the number of stockbrokers. The number of stockbrokers will range from 1 to 100. The input is terminated by a set of stockbrokers containing 0 (zero) people.
Output
It is possible that your program will receive a network of connections that excludes some persons, i.e. some people may be unreachable. If your program detects such a broken network, simply output the message "disjoint". Note that the time taken to pass the message from person A to person B is not necessarily the same as the time taken to pass it from B to A, if such transmission is possible at all.
Sample Input
3
2 2 4 3 5
2 1 2 3 6
2 1 2 2 2
5
3 4 4 2 8 5 3
1 5 8
4 1 6 4 10 2 7 5 2
0
2 2 5 1 5
0
Sample Output
3 2
3 10
题意:给出若干条边,让选出一个点,使该点到所有的点的最大距离最短,输出这个点和最大距离
题解:终于1A了……本来以为10分钟水出来的代码肯定会WA的……
这道题非常简单,就是模板题
除了disjoint,emmm样例不合理啊
代码如下:
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std; vector< pair<int,int> > g[];
int d[],vis[],n,ans,tmp1; void spfa(int u)
{
for(int i=;i<=n;i++)
{
d[i]=inf;
}
d[u]=;
queue<int> q;
q.push(u);
while(!q.empty())
{
int x=q.front();
q.pop();
vis[x]=;
int sz=g[x].size();
for(int k=;k<sz;k++)
{
int y=g[x][k].first;
int w=g[x][k].second;
if(d[x]+w<d[y])
{
d[y]=d[x]+w;
if(!vis[y])
{
q.push(y);
vis[y]=;
}
}
}
}
} int main()
{
while(scanf("%d",&n)&&n)
{
for(int i=;i<=n;i++)
{
g[i].clear();
}
ans=inf;
int m;
for(int i=;i<=n;i++)
{
scanf("%d",&m);
for(int j=;j<=m;j++)
{
int t,w;
scanf("%d%d",&t,&w);
g[i].push_back(make_pair(t,w));
}
}
for(int i=;i<=n;i++)
{
memset(vis,,sizeof(vis));
spfa(i);
int max1=,tmp2;
for(int j=;j<=n;j++)
{
max1=max(d[j],max1);
}
if(ans>max1)
{
ans=max1;
tmp1=i;
}
}
if(ans>=inf)
{
puts("disjoint");
}
else
{
printf("%d %d\n",tmp1,ans);
}
}
}
最新文章
- sip协议音视频性能测试
- C#委托与事件初探
- linux基础-附件1 linux系统启动流程
- asp.net截取指定长度的字符串内容
- [转载] tmux的使用tips
- 支持SQL Server数据库又支持MongoDB数据库的数据访问设计
- CSS3的几个标签速记3
- C#调用C++编写的DLL函数, 以及各种类型的参数传递 z
- Lua学习2 Lua小框架的搭建
- (转)详解JS位置、宽高属性之一:offset系列
- R语言︱词典型情感分析文本操作技巧汇总(打标签、词典与数据匹配等)
- 基于reflectasm打造自己的通用bean工具
- PL/SQL连接数据库时报错12154
- 关于Oracle使用管理员账号登录失败的问题
- WPF ComboBox SelectionChanged事件里赋值Text的解决方法
- MySql之安装以及设置密码等
- c++ 多态,虚函数、重载函数、模版函数
- CentOS7.0安装Nginx 1.10.0
- HDU 2955(01背包)
- TCP的粘包