Advertisement
Guest User

ques

a guest
Dec 17th, 2017
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.93 KB | None | 0 0
  1. You are given an array a. Some element of this array ai is a local minimum iff it is strictly less than both of its neighbours (that is, ai < ai - 1 and ai < ai + 1). Also the element can be called local maximum iff it is strictly greater than its neighbours (that is, ai > ai - 1 and ai > ai + 1). Since a1 and an have only one neighbour each, they are neither local minima nor local maxima.
  2.  
  3. 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.
  4.  
  5. Input
  6. The first line contains one integer n (1 ≤ n ≤ 1000) — the number of elements in array a.
  7.  
  8. The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the elements of array a.
  9.  
  10. Output
  11. Print the number of local extrema in the given array.
  12.  
  13. Example
  14. Input
  15. 3
  16. 1 2 3
  17. Output
  18. 0
  19. Input
  20. 4
  21. 1 5 2 5
  22. Output
  23. 2
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement