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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        // Your code here!
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        if (n <= 2) {
            System.out.println(0);
            return;
        }
        boolean up = true;
        boolean down = true;
        int tmp = sc.nextInt();
        int tmp2 = sc.nextInt();
        if (tmp < tmp2) {
            down = false;
        }
        if (tmp > tmp2) {
            up = false;
        }
        n--;
        n--;
        
        int prev = tmp2;
        int count = 0;
        while (n-- > 0) {
            int next = sc.nextInt();
            if (up && !down) {
                if (prev > next) {
                    // System.out.println(prev + " " + next);
                    count++;
                    prev = next;
                    if (n == 0) break;
                    next = sc.nextInt();
                    n--;
                    up = true;
                    down = true;
                    if (prev < next) {
                        down = false;
                    }
                    if (prev > next) {
                        up = false;
                    }
                    prev = next;
                    continue;
                }
            } else if (!up && down) {
                if (prev < next) {
                    count++;
                    prev = next;
                    if (n == 0) break;
                    next = sc.nextInt();
                    n--;
                    up = true;
                    down = true;
                    if (prev < next) {
                        down = false;
                    }
                    if (prev > next) {
                        up = false;
                    }
                    prev = next;
                    continue;
                }
            }
            
            if (prev < next) {
                up = true;
                down = false;
            }
            if (prev > next) {
                up = false;
                down = true;
            }
            prev = next;
        }
        System.out.println(count+1);
        
    }
}