pku1125 Stockbroker Grapevine
2012-04-19 15:30
351 查看
求一个图中到其他点的最短路的最大值最小的点和这个值。
floyd一遍完事
View Code
floyd一遍完事
View Code
program pku1125(input,output); var f:array[0..300,0..300] of longint; n:longint; procedure init; var i,j,s,x,y:longint; begin fillchar(f,sizeof(f),30); for i:=1 to n do begin read(s); for j:=1 to s do begin read(x,y); f[i,x]:=y; end; readln; end; for i:=1 to n do f[i,i]:=0; end;{ init } procedure main; var i,j,k:longint; answer,max,people:longint; begin for k:=1 to n do for i:=1 to n do for j:=1 to n do if f[i,k]+f[k,j]<f[i,j] then f[i,j]:=f[i,k]+f[k,j]; answer:=19950714; for i:=1 to n do begin max:=0; for j:=1 to n do if (i<>j)and(f[i,j]>max) then max:=f[i,j]; if max<answer then begin answer:=max; people:=i; end; end; writeln(people,' ',answer); end;{ main } begin readln(n); while n<>0 do begin init; main; readln(n); end; end.
相关文章推荐
- pku 1125 Stockbroker Grapevine 第一周训练——最短路
- 开始做图论题目“Stockbroker Grapevine”PKU1125
- pku_1125_Stockbroker Grapevine
- pku1125: Stockbroker Grapevine
- Pku acm 1125 Stockbroker Grapevine 数据结构题目解题报告(八)---- 弗洛伊德(floyd)算法
- POJ 1125 Stockbroker Grapevine 最短路folyd算法
- POJ 1125 -- Stockbroker Grapevine (弗洛伊德最短路)
- 1125:Stockbroker Grapevine
- [POJ1125]-Stockbroker Grapevine
- [floyd]poj1125 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
- poj 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine (floyd算法,最短路)
- POJ-1125 Stockbroker Grapevine 最短路
- poj 1125 Stockbroker Grapevine