pku 1125—Stockbroker Grapevine
2010-01-02 18:17
197 查看
/*
floyd算法
*/
#include<iostream>
#include<limits.h>
using namespace std;
#define L INT_MAX
int a[105][105],max0[105];
void floyd(int n)
{
int i,j,k;
for(k=1;k<=n;k++) //弗洛伊德算法
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(a[i][k]!=L && a[k][j]!=L && a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
}
int main()
{
int n,m,i,j,k,to,value;
while(cin>>n)
{
if(n==0)break;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j)a[i][j]=0;
else a[i][j]=L;
}
}
for(i=1;i<=n;i++)
{
cin>>m;
for(j=1;j<=m;j++)
{
cin>>to>>value;
a[i][to]=value;
}
}
floyd(n);
for(i=1;i<=n;i++)
{
max0[i]=0;
for(j=1;j<=n;j++)
{
if(max0[i]<a[i][j])max0[i]=a[i][j];
}
}
int min=L,ans;
for(i=1;i<=n;i++)
{
if(max0[i]<min)
{
min=max0[i];
ans=i;
}
}
if(min==L)cout<<"disjoint"<<endl;
else cout<<ans<<" "<<min<<endl;
}
system("pause");
return 0;
}
floyd算法
*/
#include<iostream>
#include<limits.h>
using namespace std;
#define L INT_MAX
int a[105][105],max0[105];
void floyd(int n)
{
int i,j,k;
for(k=1;k<=n;k++) //弗洛伊德算法
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(a[i][k]!=L && a[k][j]!=L && a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
}
int main()
{
int n,m,i,j,k,to,value;
while(cin>>n)
{
if(n==0)break;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j)a[i][j]=0;
else a[i][j]=L;
}
}
for(i=1;i<=n;i++)
{
cin>>m;
for(j=1;j<=m;j++)
{
cin>>to>>value;
a[i][to]=value;
}
}
floyd(n);
for(i=1;i<=n;i++)
{
max0[i]=0;
for(j=1;j<=n;j++)
{
if(max0[i]<a[i][j])max0[i]=a[i][j];
}
}
int min=L,ans;
for(i=1;i<=n;i++)
{
if(max0[i]<min)
{
min=max0[i];
ans=i;
}
}
if(min==L)cout<<"disjoint"<<endl;
else cout<<ans<<" "<<min<<endl;
}
system("pause");
return 0;
}
相关文章推荐
- (最短路-floyd+邻接矩阵)PKU-1125 Stockbroker Grapevine
- pku1125 Stockbroker Grapevine
- pku 1125 Stockbroker Grapevine(Floyd-Warshall)
- Pku acm 1125 Stockbroker Grapevine 动态规划题目解题报告(十九)
- pku1125 Stockbroker Grapevine
- POJ - 1125 Stockbroker Grapevine (动态规划理解floyd)
- Stockbroker Grapevine (POJ 1125)
- poj 1125 Stockbroker Grapevine
- POJ-1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine——Floyd
- POJ 1125 Stockbroker Grapevine (动规)
- POJ 1125 Stockbroker Grapevine(floyd两点间最短距离)
- poj 1125 Stockbroker Grapevine
- Stockbroker Grapevine--POJ 1125
- poj --1125----Stockbroker Grapevine(多源最短路径)
- POJ 1125 Stockbroker Grapevine (Floyd算法)