ACM演算法集5

loc(i:integer):pointer;

procedure loc(l:linklist; i:integer):pointer;

var p:pointer;

j:integer;

begin

p:=l.head; j:=0;

if (i>=1) and (i<=l.len) then

while j

．單鏈表的插入操作

var p,q:pointer;

begin

p:=loc(l,i);

new(q);

q^.data:=x;

q^.next:=p^.next;

p^.next:=q;

inc(l.len);

end;

var p,q:pointer;

begin

p:=loc(l,i-1);

q:=p^.next;

p^.next:=q^.next;

dispose(q);

dec(l.len);

end;

new(q);

q^.data:=x;

q^.pre:=p;

q^.next:=p^.next;

p^.next:=q;

q^.next^.pre:=q;

p^.pre^.next:=p^.next;

p^.next^.pre:=p^.pre;

dispose(p);

關鍵路徑（最長路經）：

var a,b:array [1..10,1..10] of integer;

n,last,out:integer;

q,c:array [1..10] of integer;

o:set of 1..10;

procedure init;

var i,j:integer;

begin

readln(n);

for i:=1 to n do

for j:=1 to n do

read(a[i,j]);

last:=0;

o:=; out:=0;

b:=a;

end;

procedure sort;

var i,j:integer;

p:boolean;

begin

while out<>n do begin

for i:=1 to n do

if not (i in o) then begin

p:=true;

for j:=1 to n do

if a[j,i]=1 then begin

p:=false;

break;

end;

if p then begin

inc(last);

q[last]:=i;

inc(out);

o:=o+[i];

fillchar(a[i],sizeof(a[i]),0);

end;

end;

end;

end;

procedure work_1;

var i,j,t,k:integer;

begin

a:=b; c[1]:=0;

for i:=1 to n do begin

k:=0;

for j:=1 to i-1 do

if (a[q[j],q[i]]>0) and (a[q[j],q[i]]+c[q[j]]>k)

then k:=a[q[j],q[i]]+c[q[j]];

c[q[i]]:=k;

end;

end;

procedure work_2;

var i,j,k:integer;

begin

writeln(q[n]);

for i:=n-1 downto 1 do begin

k:=maxint;

for j:=i+1 to n do