In the galleon yard of Masthead, Ulmar the archivist keeps careful count of the ribbons. plan the beacon maintenance rota, every figure matters. Task: Print the length of the longest contiguous run in which every two consecutive elements differ. Input format: First line: n. Second line: n integers. Output format: Print the maximum alternating run length. Constraints: 1 <= n <= 3159; -1000000 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 3159; -1000000 <= a[i] <= 1000000.
