Предыдущая страница реферата | 1  2  3  4  5  6  7  8  9  10  11 | Следующая страница реферата

);

R : array[1..S, 0..Lmax] of integer = (

{0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 }

(0, 0, 0, 0, 0, 20, 0, 10, 0, 0, 10, 0, 6, 10, 10, 10, 10, 10 ),

(0, 0,13,11, 1,12, 10, 17,19,12, 11,17,16, 13, 13, 13, 13, 13 ),

(0, 0,13,28,11, 20, 17,16, 16,16,16, 27,37, 38, 38, 18, 18, 8 ),

(0,11,13,21,11, 22, 10, 17, 3, 9, 20, 6, 6, 17, 14, 10, 10, 10 ),

(0,11, 30,8,11,12, 11, 17,14, 2, 11,27,26, 33, 33, 33, 33, 33 ),

(0,11,13,27, 1, 14, 17,16, 16, 6, 6, 7,17, 18, 18, 18, 8, 28 ),

(0,13,12,26, 1, 22, 10, 14,17, 9, 10,26,26, 17, 14, 15, 10, 11 ),

(0,13,11,25,21, 2, 0, 17,19, 2, 11,27,26, 13, 13, 13, 13, 13 ),

(0,15,16,21,21, 21, 15,16, 18, 6, 6, 27,27, 28, 11, 28, 28, 8 ),

(0,16,19,23, 1, 20, 12, 4, 26,21,26, 27,27, 28, 14, 18, 28, 38 )

);

{ Максимальные объемы финансирования отделов }
L : array[1..S] of integer = ( 12, 5, 3, 10, 11, 7, 8, 10, 6, 17 );

b then min := b else min := a; end;

var i, j, y, k, f : integer;
Sum, nn : integer;

pp, qq, rr : array[1..S, 0..Lmax] of integer;

T : array[0..S, 0..N] of record y, g : integer; end;

T2 : array[0..3, 0..Lmax] of record y, g : integer; end;

Income : array[1..S, 0..3] of integer;

begin
ClrScr;

{ Поиск p(y) } for j := 1 to S do for y := 0 to L[j] do pp[j, y] := P[j, y];

{ Поиск q(y) } for j := 1 to S do for y := 0 to L[j] do begin qq[j, y] := Q[j, 0] + pp[j, y]; for i := 1 to y do if Q[j, i] + pp[j, y-i] > qq[j, y] then qq[j, y] := Q[j, i] + pp[j, y-i]; end;

{ Поиск r(y) } for j := 1 to S do for y := 0 to L[j] do begin rr[j, y] := R[j, 0] + qq[j, y]; for i := 1 to y do if R[j, i] + qq[j, y-i] > rr[j, y] then rr[j, y] := R[j, i] + qq[j, y-i]; end;

Рекомендуем скачать другие рефераты по теме: сочинения по картинам, изложение на тему.

Предыдущая страница реферата | 1  2  3  4  5  6  7  8  9  10  11 | Следующая страница реферата

Поделитесь этой записью или добавьте в закладки