两交两running?

program aa;

var

x,n,i,j,min,m2:longint;

a:array[1..1000,1..1000] of longint;

f:array[1..1000,1..2] of longint;

procedure find(x:longint);

begin

if x=0 then exit;

find(f[x,2]);

write(x,' ');

end;

begin

readln(n);

for i:=1 to n do

for j:=1 to n do

read(a);

fillchar(f,sizeof(f),0);

for i:=2 to n do

begin

min:=maxlongint;

for j:=1 to i-1 do

if (a[j,i]>0) and (f[j,1]+a[j,i]