Автор: Anton

Anton — Thu, 10 Mar 2016 06:41:14 +0000

Было:

program Array35;

var
  a:array[1..10] of integer;
  N,i,Max:Integer;

begin
  Write('N: ');
  Readln(N);
  for i:=1 to N do
   begin
    write(i,' :');
    readln(a[i]);
   end;
  Max:= 32768;
  for i:=2 to N-1 do
  if (a[i-1]<a [i]) and (a[i]>a[i+1]) then
    if a[i]<max then Max:=a[i];
  Writeln(Max);
  readln;
end.

program Array35;

var

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

N,i,Max:Integer;

begin

Write('N: ');

Readln(N);

for i:=1 to N do

begin

write(i,' :');

readln(a[i]);

end;

Max:= 32768;

for i:=2 to N-1 do

if (a[i-1]<a [i]) and (a[i]>a[i+1]) then

if a[i]<max then Max:=a[i];

Writeln(Max);

readln;

end.

Стало:

program Array35;

var
  a:array[1..10] of integer;
  N,i,Max:Integer;
  checkbox:boolean;

begin
  Write('N: ');
  Readln(N);
  for i:=1 to N do
   begin
    write(i,' :');
    readln(a[i]);
   end;
  if a[1]>a[2] then
   begin
    Max:=a[1];
    checkbox:=False;
   end
  else
   begin
    checkbox:=True;
    Max:=0;
   end;
  for i:=2 to N-1 do
   if (a[i-1]<a [i]) and (a[i]>a[i+1]) then
    if (a[i]<max ) or checkbox then
     begin
      Max:=a[i];
      checkbox:=False;
     end;

  if a[N-1]<a[N] then
    if (a[N]<Max) or checkbox then Max:=a[N];

  Writeln(Max);
end.

program Array35;

var

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

N,i,Max:Integer;

checkbox:boolean;

begin

Write('N: ');

Readln(N);

for i:=1 to N do

begin

write(i,' :');

readln(a[i]);

end;

if a[1]>a[2] then

begin

Max:=a[1];

checkbox:=False;

end

else

begin

checkbox:=True;

Max:=0;

end;

for i:=2 to N-1 do

if (a[i-1]<a [i]) and (a[i]>a[i+1]) then

if (a[i]<max ) or checkbox then

begin

Max:=a[i];

checkbox:=False;

end;

if a[N-1]<a[N] then

if (a[N]<Max) or checkbox then Max:=a[N];

Writeln(Max);

end.

Автор: olegst1975

olegst1975 — Wed, 09 Mar 2016 20:08:42 +0000

Тоже, что и в Array34

Комментарии: Решаем задачи Абрамян на Паскале. Array35

Автор: Anton

Автор: olegst1975