Решение задачи Array 38

#include <stdio.h>
 
int main(void)
{
    int a[10];
    int n;
 
    printf("N: ");
    scanf("%i",&n);
 
    int i,num=0;
    for (i=0; i<n; ++i){
        printf("a[%i] : ",i+1);
        scanf("%i",&a[i]);
    }
 
    for (i=2;i<n;++i){
        if ((a[i-2]>a[i-1]) && !(a[i-1]>a[i])){
            ++num;
        }
 
    }
 
    if (a[n-2]>a[n-1]) ++num;
 
    printf("%i \n",num);
    return 0;
}

import random

N = random.randrange(2,21)
#N = 15
a = [random.randrange(1,10) for i in range(N)]

##a = [3, 3, 1, 8, 9, 6, 9, 2, 6, 6, 2, 6, 2, 9, 6]
#a = [7, 2, 1, 8, 2, 8, 6, 9, 9, 2, 2, 2, 8, 9, 5]
##for i in range(0,N):
##    a[i] = N - i
##a[7] = 0
##a = [17, 13, 15]

print("N = ", N)
print("Array:")
print(a)

k = 0
flag = True
for i in range(1,N):
    if a[i-1] > a[i] :
        if flag:
            k += 1
            flag = False
    else :
        flag = True

print("Monotonous Decrease areas:",k)


import matplotlib.pyplot as plt
plt.plot(a)
plt.show()
									

program Array38;
 
var
  a:array[1..10] of integer;
  N,i,Num:Integer;
 
begin
  a[1]:=0;
  Write('N: ');
  Readln(N);
  for i:=1 to N do
   begin
    write(i,' :');
    readln(a[i]);
   end;
 
  Num:=0;
 
  for i:=3 to N do
  if (a[i-2]>a[i-1]) and not(a[i-1]>a[i]) then inc(Num);
 
  if a[N-1]>a[N] then inc(Num);
 
 
  Writeln(Num);
  readln;
end.