Решение на Паскале.

const N = 30;

var

a: array [1..N] of integer;

MaxIncr, NumIncr, i: integer;

begin

for i := 1 to N do readln(a[i]);

MaxIncr: =1;

NumIncr: =1;

for i: =1 to N-1 do

if (a[i] < a [i+1]) then NumIncr: =NumIncr+1 else

begin

if (NumIncr > MaxIncr) then MaxIncr: =NumIncr;

NumIncr: =1;

end;

if (NumIncr > MaxIncr) then MaxIncr:=NumIncr;

writeln (MaxIncr);

end.

Const N=30;

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

i: integer;

begin

for i:=1 to N do { ввод всех элементов массива с клавиатуры }

read(a[i]);

for i:=1 to N do { формирование массива B }

b[i]:= abs(a[i])

end.

const N=30;

var a: array[1..N] of integer;

MaxEven, NumEven, i: integer;

begin

MaxEven:=0;

NumEven:=0;

for i:=1 to N do

read(a[i]);

for i:=1 to N do

if (a[i] mod 2 = 0) then

NumEven:=NumEven+1

else begin

if NumEven>=MaxEven then

MaxEven:=NumEven;

NumEven:=0;

end;

if NumEven>=MaxEven then

MaxEven:=NumEven;

Writeln(MaxEven);

end.

var a:array [1..30] of integer;

i,s:integer;

begin

s:=1;

for i:=1 to 30 do begin

readln(a[i]);

if a[i]<0 then s:=s*a[i];

end;

write(s);

end.

uses crt;

const N=30;

var a:array[1..N] of integer;

i,count,max:integer;

Begin

count:=0;

max:=0;

for i:=1 to N do

begin

write('a[',i,']= ');

readln(a[i]);

end;

for i:=1 to N do

if a[i]<0 then inc(count)

else

begin

if count>=max then max:=count;

count:=0;

end;

if count>=max then max:=count;

Writeln('Max= ',max);

End.