Problem:
Score : 300 points

Problem Statement

You are given an array A of length N.
Your task is to divide it into several contiguous subarrays.
Here, all subarrays obtained must be sorted in either non-decreasing or non-increasing order.
At least how many subarrays do you need to divide A into?

Constraints

1 \leq N \leq 10^5

1 \leq A_i \leq 10^9

Each A_i is an integer.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the minimum possible number of subarrays after division of A.

Sample Input 1

6
1 2 3 2 2 1

Sample Output 1

2

One optimal solution is to divide the array into [1,2,3] and [2,2,1].

Sample Input 2

9
1 2 1 2 1 2 1 2 1

Sample Output 2

5

Sample Input 3

7
1 2 3 2 1 999999999 1000000000

Sample Output 3

3

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i=0; i<(ll)(n); i++)
#define repd(i,n) for (ll i=n-1; i>=0; i--)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define PF push_front
#define PB push_back
int main()
{
    ll N; cin >> N;
    vector<ll> A(N);
    rep(i,N){
        cin >> A.at(i);
    }
    ll count=0;
    int judge=0;
    int last_judge=0;
    rep(i,N-1){
        if(i!=0){
            if(judge==2){
                if(A.at(i)>A.at(i+1)){
                    count++;
                    judge=1;
                    continue;
                }
            }
            if(judge==0){
                if(A.at(i)<A.at(i+1)){
                    count++;
                    judge=1;
                    continue;
                }
            }
        }
        if(A.at(i)<A.at(i+1)){
            judge=2;
        }
        else if(A.at(i)>A.at(i+1)){
            judge=0;
        }
        else if(A.at(i)==A.at(i+1)){
            judge=1;
        }
    }
    cout << count+1 << endl;
}