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: Accepted)

import java.util.*;
import java.io.*;
public class Main{
	public static void main(String[] args) throws IOException {

		try(BufferedReader kb = new BufferedReader(new InputStreamReader(System.in))){
			for (String in = kb.readLine(); in!=null; in=kb.readLine()) {
				int n= Integer.parseInt(in);
				in = kb.readLine();
				int[] arr = new int[n];
				StringTokenizer st= new StringTokenizer(in);
				for (int i = 0; i < n; i++) {
					arr[i]= Integer.parseInt(st.nextToken().trim());
				}
				System.out.println(solve(arr));
				
			}
		}
	}

	 static int solve(int[] arr) {
		 int grupos = 0;
		 if(arr.length<3)
			 return 1;
		 boolean mx = false, mn = false;

//		 if(arr[0]<arr[1])
//			 mx=true;
			 
		 for (int i = 0; i < arr.length-1; i++) {
			 if(arr[i]<arr[i+1]&&!mn){
				 mx=true;
			 }
			 else if(arr[i]>arr[i+1]&&!mx){
				 mn=true;
			 }
			 else if(arr[i]<arr[i+1]&&mn){
				 grupos++;
				 mx=false;
				 mn=false;
			 }
			 else if(arr[i]>arr[i+1]&&mx){
				 grupos++;
				 mn=false;
				 mx=false;
				 if(i+1==arr.length-1)
					 grupos++;
			 }
		}
		 if(mn||mx)
			 return grupos+1;
		return grupos;
		
	}

}