poj 1125 Stockbroker Grapevine

点击打开链接

 

代码如下：floyd算法

 

#include<iostream>#include<string.h>using namespace std;#define MAX 9999int main(){int cost[110][110];int i,j,k;int person;           int number;                  int index;                    while( cin>>person &&person>0){memset( cost,MAX,sizeof(cost) );for( i=0; i<person; ++i ){cost[i][i]=0;               cin>>number;for( j=0; j<number; ++j ){cin>>index;cin>>cost[i][index-1];   }}for( k=0; k<person; ++k )for( i=0; i<person; ++i)for( j=0; j<person; ++j ){if( cost[i][j]>cost[i][k]+cost[k][j] ){cost[i][j]=cost[i][k]+cost[k][j];}}int min = MAX;int id = 1;for( i=0; i<person; ++i ){int temp=cost[i][0];for( j=0; j<person; ++j ){if( cost[i][j]>temp ){temp = cost[i][j];}}if( temp<min ){min = temp;id = i+1;}}cout<<id<<" "<<min<<endl;}return 0;}