- 最短路上的统计
- 2009-01-20 19:15:07 @
var
f:array[1..100,1..200]of longint;
vis:array[1..100]of boolean;
i,j,k,a,b,c,d,n,m,p,t:longint;
begin
readln(n,m);
for i:=1 to n do
for j:=1 to n do
f:=maxint;
for i:=1 to n do f:=0;
for i:=1 to m do
begin
readln(a,b);
f[a,b]:=1;
f:=1;
end;
for i:=1 to n do
for j:=1 to n do
for k:=1 to n do
if f+f[k,j]
0 条评论
目前还没有评论...