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 <cstdio>
using namespace std;
const int maxn = 1e5+5;
int d[maxn];
int n;
int main(){
//freopen("input.txt", "r", stdin);
    while(scanf("%d", &n) == 1){
        for(int i = 0; i < n; i++)
            scanf("%d", &d[i]);
        bool fg1;
        if(n == 1)
        {
            printf("1\n");
            continue;
        }
//        fg1 = d[1] - d[0] ? true : false;
        int ans = 0;
        int len = 1;
        
        for(int i = 1; i < n; i++)
        {
            if(len == 1) fg1 = (d[i] - d[i-1] > 0)? true : false;
            if(fg1 == true) 
            {
                if(d[i] >= d[i-1]) {len++; continue;}
                else{
                    fg1 = false;
                    if(len > 1){ans++; len = 1;}
                }
            }
            else{
                if(d[i] <= d[i-1]) {len++;continue;}
                else{
                    fg1 = true;
                    if(len > 1){ans++; len = 1;}
                }
            }
        }
        printf("%d\n", ans+1);
    }
    return 0;
}