I - Local Extrema

最新推荐文章于 2024-08-29 16:18:42 发布

Abandoninged

最新推荐文章于 2024-08-29 16:18:42 发布

阅读量489

点赞数

分类专栏：平时学习对应知识点练习题

本文链接：https://blog.csdn.net/Abandoninged/article/details/78993307

版权

平时学习对应知识点练习题专栏收录该内容

18 篇文章 0 订阅

订阅专栏

You are given an array a. Some element of this array a_i is a local minimum iff it is strictly less than both of its neighbours (that is, a_i < a_i - 1 and a_i < a_i + 1). Also the element can be called local maximum iff it is strictly greater than its neighbours (that is, a_i > a_i - 1 and a_i > a_i + 1). Since a₁ and a_n have only one neighbour each, they are neither local minima nor local maxima.

An element is called a local extremum iff it is either local maximum or local minimum. Your task is to calculate the number of local extrema in the given array.

Input

The first line contains one integer n (1 ≤ n ≤ 1000) — the number of elements in array a.

The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 1000) — the elements of array a.

Output

Print the number of local extrema in the given array.

Example

Input

3
1 2 3

Output

Input

4
1 5 2 5

Output

给一列数字，判断一个数它的左右是否同时比它大，或者同时比它小，若满足的话那么count++，得到最后的count值，那么很明显，直接暴力的遍历一遍就可以了。

#include<iostream>
using namespace std;
int a[1005];
int main()
{
int count = 0;
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n - 1; i++)
{
if (a[i - 1] < a[i])
{
if (a[i] > a[i + 1])
count++;
}
else if (a[i - 1] > a[i])
{
if (a[i + 1] > a[i])
count++;
}
}
cout << count << endl;
return 0;
}