Задача о выборе траектории методом динамического программирования

program Transport;
const n=17; 
      m=11;
type
  mas = array[1..100,1..100] of integer;
 
var
  i, j: integer;
  cen,pyti: mas;
 
 
 
procedure vv(ms:mas);
var i,j:integer;
begin
for i:=1 to n do begin
for j:=1 to m do
if (i mod 2=0)then begin
if ((i mod 2)<>(j mod 2)) then write(ms[i,j]:2,' ') else write('   ');
end
else begin if ((i mod 2)<>(j mod 2)) then write(ms[i,j]:2,'-') else write('-+-');end;
writeln; end;
writeln;
 
end;
 
//body
begin
for i:=1 to n do
for j:=1 to m do
if ((i mod 2)<>(j mod 2)) then read(cen[i,j]);
                               //cen[i,j]:=random(20)+1;
writeln;
vv(cen);
 
//вычисления
for i:=1 to n do
for j:=1 to m do
if (i mod 2=1)then begin
if ((i mod 2)=(j mod 2)) then begin
if (i=1)and(j=1)then continue;
if (i>1)and(j=1)then begin cen[i,j]:=cen[i-2,j]+cen[i-1,j]; continue; end;
if (i=1)and(j>1)then begin cen[i,j]:=cen[i,j-2]+cen[i,j-1]; continue; end;
 
 
 
 
 
 
if cen[i-1,j]+cen[i-2,j]<cen[i,j-1]+cen[i,j-2] then begin cen[i-1,j-1]:=1; cen[i,j]:=cen[i-1,j]+cen[i-2,j];  end 
                                               else begin cen[i-1,j-1]:=2; cen[i,j]:=cen[i,j-1]+cen[i,j-2];  end;
                                              
end;
end;
 
writeln;
//определение пути
i:=n;
j:=m;
while (j>-2)and(i>-2) do
begin
if i<1 then i:=1;
if j<1 then j:=1;
pyti[i,j]:=1;
if (i=1)and(j=1)then break;
if (i=1)and(j>1)then begin pyti[i,j-1]:=1; j:=j-2; continue; end;
if (i>1)and(j=1) then begin pyti[i-1,j]:=1; i:=i-2; continue; end;
if (cen[i-1,j-1]=1) then begin pyti[i-1,j]:=1; i:=i-2;   end 
                    else begin pyti[i,j-1]:=1; j:=j-2; end;
end;
vv(pyti);
writeln('Цена минимального пути: ',cen[n,m]);
end.

begin
  var a:=arr(5,11,10,9,5,4,3,5,8,3,6,7,5,10,8,7,6,11,11,11,11,7,11,5,4,12,13,8,9,9,9,9,5,6,11,10,5,8,12,14,14,14,14,9,10,5,9,4,9,4,3,8,12,8,7,5,5,7,7,14,6,9,11,6,13,8,7,4,8,9,6,8,4,5,9,11,2,8,11,13,5,14,12,9,17,4,13,5,1,16,2,5,5);
  var index:=0;
for i:=1 to n do
for j:=1 to m do
if ((i mod 2)<>(j mod 2)) then begin cen[i,j]:=a[index];index+=1;end;//read(cen[i,j]);

const
  h : array [,] of Integer = ((5,11,10,9,5),(7,5,10,8,7),(11,5,4,12,13),(6,11,
    10,5,8),(10,5,9,4,9),(5,5,7,7,14),(7,4,8,9,6),(8,11,13,5,14),(1,16,2,5,5));
  v : array [,] of Integer = ((4,6,8,12,4,6,8,12),(3,11,9,14,3,9,4,9),(5,11,9,
    14,8,11,5,17),(8,11,9,14,12,6,9,4),(3,11,9,14,8,13,11,16),(6,7,5,9,7,8,2,5));
var
  a := MatrFill(9,6,0);
  minSum := Integer.MaxValue;
 
procedure FindPath(n, row, col, sum : Integer);
begin
  if sum >= minSum then Exit;
  a[row, col] := n;
  if (row = 8) and (col = 5) then
    minSum := sum
  else 
    begin
      if (row > 0) and (a[row-1, col] = 0) then FindPath(n+1, row-1, col, sum + v[col, row-1]);
      if (col > 0) and (a[row, col-1] = 0) then FindPath(n+1, row, col-1, sum + h[row, col-1]);
      if (row < 8) and (a[row+1, col] = 0) then FindPath(n+1, row+1, col, sum + v[col, row]);
      if (col < 5) and (a[row, col+1] = 0) then FindPath(n+1, row, col+1, sum + h[row, col]);
    end;
  a[row, col] := 0;
end;
 
begin
  FindPath(1, 0, 0, 0);
  WriteLn(minSum);
end.

var
  a : array [,] of Integer;

begin
  SetLength(a,9,6);