{"problem":{"name":"Sorted Arrays","description":{"content":"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 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc013_a"},"statements":[{"statement_type":"Markdown","content":"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?\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n*   Each $A_i$ is an integer.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc013_a","tags":[],"sample_group":[["6\n1 2 3 2 2 1","2\n\nOne optimal solution is to divide the array into $[1,2,3]$ and $[2,2,1]$."],["9\n1 2 1 2 1 2 1 2 1","5"],["7\n1 2 3 2 1 999999999 1000000000","3"]],"created_at":"2026-03-03 11:01:14"}}