int dempt (int a[], int n)
{
int dem=0;
if (n>1) dem = a[n-1]>a[n-2];
for (int i=1; i<n-1; i++)
if (a[i]>a[i-1] && a[i]>a[i+1])
dem++;
return dem;
}int dempt (int a[], int n)
{
int dem=0;
if (n>1) dem = a[n-1]>a[n-2];
for (int i=1; i<n-1; i++)
if (a[i]>a[i-1] && a[i]>a[i+1])
dem++;
return dem;
}