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: Time Limit Exceeded)

import java.util.*;

public class Main {

    long INF = Long.MAX_VALUE;

    public static void main(String[] args) {
        new Main().solve();
    }

    void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        long[] A = new long[N];
        long ans = 1;
        boolean f = true;
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }
        lavel:
        for (int i = 1; i < N; i++) {
            if (A[i - 1] < A[i]) {
                f = true;
            } else if (A[i - 1] > A[i]) {
                f = false;
            }
            if (A[i - 1] == A[i]) {
                continue;
            }
            for (int j = i + 1; j < N; j++) {
                if ((f == false) && A[j - 1] < A[j]) {
                    ans++;
                    i = j;
                    break;
                } else if ((f == true) && A[j - 1] > A[j]) {
                    ans++;
                    i = j;
                    break;
                }
                if (A[j - 1] == A[j]) {
                    continue;
                }
            }
        }
        System.out.println(ans);
    }
}