1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#include<bits/stdc++.h>
using namespace std;

int searching(int arr[], int n)
{
    int ans = 0;
    int bigger = 0, smaller = 0, equal = 0, incorrect = 0, biggerStrike = 0, smallerStrike = 0, incorrectStrike = 0;
    int finalBigger = 0, finalSmaller = 0, finalEqual = 0, finalIncorrect = 0;
    if(n == 3) 
    {
        ans = 1;
        return ans;
    }
    if(arr[0] < arr[1]) 
    {
        smaller++;
        smallerStrike++;
    }
    else if(arr[0] > arr[1]) 
    {
        bigger++;
        biggerStrike++;
    }
    else if(arr[0] == arr[1]) 
    {
        equal++;
    }
    for (int i = 2; i < n - 1; i+=2)
    {
        if(arr[i] < arr[i + 1] && arr[i] < arr[i - 1]) 
        {
            smaller++;
            smallerStrike++;
            
            if(biggerStrike ==2 ) 
            {
                finalBigger++;
                
            }
            if(incorrectStrike ==2 ) 
            {
                finalIncorrect++;
                
            }
            
            
            biggerStrike = 0;
            incorrectStrike = 0;
        }
        else if(arr[i] > arr[i + 1] && arr[i] > arr[i -1 ]) 
        {
            bigger++;
            biggerStrike++;
            
            if(smallerStrike ==2 ) 
            {
                finalSmaller++;
                
            }
            if(incorrectStrike ==2 ) 
            {
                finalIncorrect++;
                
            }
           
            smallerStrike = 0;
            incorrectStrike = 0;
            
        }
        else if(arr[i] == arr[i + 1] && arr[i] == arr[i -1 ]) 
        {
            equal++;
           
           
            if(biggerStrike ==2 ) 
            {
                finalBigger++;
                
            }
            if(incorrectStrike ==2 )
            { 
                finalIncorrect++;
                
            }
            if(smallerStrike ==2 ) 
            {
                finalSmaller++;
                
            }
             biggerStrike = 0;
            incorrectStrike = 0;
            smallerStrike = 0;
        }
        else 
        {
            incorrect++;
            incorrectStrike++;
           
            if(biggerStrike ==2 ) 
            {
                finalBigger++;
                
            }
            if(smallerStrike ==2 ) 
            {
                finalSmaller++;
                
            }
            
             biggerStrike = 0;
            smallerStrike = 0;
            
        }
    }
    if(biggerStrike >=2 ) 
    {
        finalBigger++;
                
    }
    if(smallerStrike >=2 ) 
    {
        finalSmaller++;
                
    }
    if(incorrectStrike >= 2 ) 
    {
        finalIncorrect++;
                
    }
    
    if(max(bigger, smaller) == bigger)
    {
        ans = smaller + equal + incorrect - finalEqual - finalIncorrect - finalSmaller;
    }
    else
    {
        ans = bigger + equal + incorrect - finalEqual - finalIncorrect - finalBigger;
    }

    return ans;
}

int main()
{
    int n; cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++) cin >> arr[i];
    

    cout<<searching(arr, n);
}