顶顶……

这是我做的spfa

var cost:array[1..100,1..100]of longint;

dist:array[1..100]of longint;

vis:array[1..100]of boolean;

q:array[1..10000]of integer;

n,m,h,t,x:integer;

procedure init;

var i,j,k,m:integer;

begin

readln(n,m);

for i:=1 to m do readln(j,k,cost[j,k]);

for i:=1 to n do

for j:=i to n do cost[j,i]:=maxint;

for i:=1 to n do dist[i]:=maxint;

dist[1]:=0;

end;

procedure spfa;

var i:integer;

begin

t:=1;q[t]:=1;vis[1]:=true;

repeat

inc(h);x:=q[h];vis[h]:=false;

for i:=1 to n do

if(cost[x,i]0)and(dist[x]+cost[x,i]