POJ1125
来源:互联网 发布:烯牛数据 安卓 编辑:程序博客网 时间:2024/05/18 00:36
#include <iostream>
#include <stdio.h>
#define INF 1000
#define maxn 100000
using namespace std;
int map[INF][INF];
int t,maxs,mintime,a,w,n,pos;
void Floyd()
{
for( int k = 1; k <= t; k++)
for( int i = 1; i <= t; i++)
for( int j = 1; j <= t; j++ )
if(map[i][j] > map[i][k] + map[k][j])
map[i][j] = map[i][k] + map[k][j];
return ;
}
int main()
{
while(scanf("%d",&t),t)
{
for( int i = 1; i<=t ; i++)
for( int j = 1; j<= t; j++)
{
if( i != j)
map[i][j] = maxn;
else
map[i][j] = 0;
}
for( int i = 1; i <= t; i++)
{
scanf("%d",&n);
for( int j = 1; j<=n; j++)
{
scanf("%d%d",&a, &w);
map[i][a] = w;
}
}
Floyd();
mintime = 100000;
for( int j = 1; j<= t ; j++)
{
maxs = 0;
for( int i = 1; i<=t ; i++)
{
if( map[j][i] > maxs)
maxs = map[j][i];
}
if(mintime > maxs)
{
mintime = maxs;
//cout<<mintime<<endl;
pos = j;
}
}
// for( int i = 1; i<= t; i++)
//{for( int j = 1; j<= t; j++)
//cout<<map[i][j]<<" ";
//cout<<endl;}
//cout<<pos<<' '<<mintime<<endl;
if(mintime != maxn)
printf("%d %d\n",pos,mintime);
else
printf("disjoint\n");
}
}
#include <stdio.h>
#define INF 1000
#define maxn 100000
using namespace std;
int map[INF][INF];
int t,maxs,mintime,a,w,n,pos;
void Floyd()
{
for( int k = 1; k <= t; k++)
for( int i = 1; i <= t; i++)
for( int j = 1; j <= t; j++ )
if(map[i][j] > map[i][k] + map[k][j])
map[i][j] = map[i][k] + map[k][j];
return ;
}
int main()
{
while(scanf("%d",&t),t)
{
for( int i = 1; i<=t ; i++)
for( int j = 1; j<= t; j++)
{
if( i != j)
map[i][j] = maxn;
else
map[i][j] = 0;
}
for( int i = 1; i <= t; i++)
{
scanf("%d",&n);
for( int j = 1; j<=n; j++)
{
scanf("%d%d",&a, &w);
map[i][a] = w;
}
}
Floyd();
mintime = 100000;
for( int j = 1; j<= t ; j++)
{
maxs = 0;
for( int i = 1; i<=t ; i++)
{
if( map[j][i] > maxs)
maxs = map[j][i];
}
if(mintime > maxs)
{
mintime = maxs;
//cout<<mintime<<endl;
pos = j;
}
}
// for( int i = 1; i<= t; i++)
//{for( int j = 1; j<= t; j++)
//cout<<map[i][j]<<" ";
//cout<<endl;}
//cout<<pos<<' '<<mintime<<endl;
if(mintime != maxn)
printf("%d %d\n",pos,mintime);
else
printf("disjoint\n");
}
}
0 0
- poj1125
- poj1125
- poj1125
- POJ1125
- poj1125
- POJ1125
- poj1125
- poj1125
- poj1125
- POJ1125
- poj1125
- poj1125
- poj1125(Floyd)
- poj1125 Stockbroker
- POJ1125-Floyd
- poj1125 (Floyd)
- POJ1125 Floyd
- poj1125--Floyd
- CXF WEBSERVICE SAMPLE
- bzoj1202:狡猾的商人
- 飞行员配对方案问题(二分图的最大匹配)
- pat(basic level) 1003
- 三角形的面积 矢量法
- POJ1125
- 支付宝的公钥私钥算法openssl及扩展阅读
- android实现按钮监听的五种方法
- C++默认构造函数
- __try,__except,__finally,__leave异常模型机制
- 如何在ubuntu/mint下安装quake2
- 高质量C++编程指南要点
- Eclipse使用过程中出现java.lang.NoClassDefFoundError的解决方案
- 如何使用 orachk 工具