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 (GCC 5.4.1) (judge verdict: Runtime Error)

#include<stdio.h>
#include<stdlib.h>

int main()
{
	int n, i,k = 1,   count = 0;

	scanf("%d", &n);
	int *a = (int*)malloc(n * sizeof(int));
	int *b = (int*)malloc((n - 1) * sizeof(int));

	for (i = 0; i < n; i++) {
		scanf("%d", &a[i]);
	}
	for (i = 0; i < n; i++) {
		b[i] = a[i + 1] - a[i];
	}

	while (k < n - 1) {
		if (b[k] <= 0 && b[k- 1] <= 0) {
			int j = k + 1;
			if (j == n - 1)break;
			while(j<n-1) {
				if (b[j] <= 0 && b[j - 1] <= 0) {
					j++;
				}
				else {
					count++;
					k = j + 2;
					break;
				}
			}
		}
		if (b[k] >= 0 && b[k - 1] >= 0) {
			int j = k + 1;
			if (j == n - 1)break;
			while (j < n - 1) {
				if (b[j] >= 0 && b[j - 1] >= 0) {
					j++;
				}
				else {
					count++;  
					k = j + 2;
					break;
				}
			}
		}
		else {
			count++;
			k += 2;
		}
	}
	


	printf("%d\n", count+1); 
        free(a);
        free(b);
	return 0;
}