codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1467B.md (1769B)


      1 Source: https://codeforces.com/problemset/problem/1467/B
      2 
      3 B. Hills And Valleys
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j \gt a_{{j+1}}$ and $a_j \gt a_{{j-1}}$; and let us call it a valley if $a_j \lt a_{{j+1}}$ and $a_j \lt a_{{j-1}}$.
     22 
     23 Let us define the intimidation value of a sequence as the sum of the number of hills and the number of valleys in the sequence. You can change exactly one integer in the sequence to any number that you want, or let the sequence remain unchanged. What is the minimum intimidation value that you can achieve?
     24 
     25 Input
     26 
     27 The first line of the input contains a single integer $t$ ($1 \le t \le 10000$) — the number of test cases. The description of the test cases follows.
     28 
     29 The first line of each test case contains a single integer $n$ ($1 \le n \le 3\cdot10^5$).
     30 
     31 The second line of each test case contains $n$ space-separated integers $a_1$, $a_2$, ..., $a_n$ ($1 \le a_i \le 10^9$).
     32 
     33 It is guaranteed that the sum of $n$ over all test cases does not exceed $3\cdot10^5$.
     34 
     35 Output
     36 
     37 For each test case, print a single integer — the minimum intimidation value that you can achieve.
     38 
     39 Example
     40 
     41 Input
     42 
     43 ```
     44 4
     45 3
     46 1 5 3
     47 5
     48 2 2 2 2 2
     49 6
     50 1 6 2 5 2 10
     51 5
     52 1 6 2 5 1
     53 ```
     54 
     55 Output
     56 
     57 ```
     58 0
     59 0
     60 1
     61 0
     62 ```
     63 
     64 Note
     65 
     66 In the first test case, changing $a_2$ to $2$ results in no hills and no valleys.
     67 
     68 In the second test case, the best answer is just to leave the array as it is.
     69 
     70 In the third test case, changing $a_3$ to $6$ results in only one valley (at the index $5$).
     71 
     72 In the fourth test case, changing $a_3$ to $6$ results in no hills and no valleys.