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# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections;
using System.Linq;
namespace AGC013A
{
    class Program
    {
        static int Main()
        {
            int n = int.Parse(Console.ReadLine());
            int[] a = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
            ArrayList al = new ArrayList();
            al.Add(a[0]);
            for (int i = 1; i < n; i++)
                if (a[i - 1] != a[i])
                    al.Add(a[i]);
            int[] a2 = (int[])al.ToArray(typeof(int));
            n = a2.Length;
            if (n < 3)
            {
                Console.WriteLine(1);
                Environment.Exit(0);
            }
            int ans = 1;
            for (int i = 1; i < n - 1; i++)
            {
                if (a[i - 1] < a[i] && a[i] > a[i + 1])
                {
                    ans++;
                    i++;
                }
                if (a[i - 1] > a[i] && a[i] < a[i + 1])
                {
                    ans++;
                    i++;
                }
            }
            Console.WriteLine(ans);
            return 0;
        }
    }
}