CT33482

The Zigzag Stretch of the Shimmering stretches

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Every season at the cinnabar mines of Vermilion, someone must prepare the expedition manifest. This year the task falls to Cressida, armed only with the stretches register. 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 <= 3458; 1 <= a[i] <= 1000.

Example 1:

Input: 593 1 3 2 5 1 3 5 4 2 3 5 4 5 1 4 3 3 5 4 5 1 2 3 5 2 3 4 2 4 2 5 2 4 5 3 2 5 2 5 4 2 4 4 2 4 2 4 1 3 2 3 1 3 5 5 4 5 2 5 5 4 5 4 5 2 2 4 5 2 1 1 3 5 1 5 1 5 4 1 4 4 3 1 1 2 4 3 1 4 1 4 3 5 1 2 4 3 3 5 2 3 2 2 1 3 4 5 4 4 5 1 1 4 5 1 5 5 2 1 5 3 1 2 2 3 4 3 1 4 4 1 1 4 3 3 5 3 2 2 1 2 4 3 5 4 1 1 4 2 5 3 3 4 3 3 4 5 1 3 1 3 3 2 2 3 4 3 1 5 4 4 5 5 3 4 4 5 1 3 3 1 2 4 5 5 2 5 2 5 1 2 2 3 1 3 3 4 1 2 3 2 2 5 4 5 4 4 1 2 4 3 2 3 2 1 3 3 1 1 2 3 4 2 5 3 5 1 1 4 1 5 4 2 2 2 3 5 3 1 2 4 1 2 2 5 1 5 1 4 5 3 2 5 5 1 2 3 5 1 1 4 1 5 2 5 3 5 2 3 5 4 3 2 5 1 1 1 4 4 5 5 1 5 5 5 1 5 1 1 3 2 1 3 5 1 3 4 1 3 5 5 1 5 2 3 1 2 4 1 1 3 1 5 4 2 1 2 4 5 3 4 1 3 5 5 2 4 3 1 5 3 5 4 5 4 4 1 3 1 1 2 4 5 1 3 3 4 5 1 2 1 5 3 3 1 1 4 2 4 2 1 3 4 1 1 5 1 5 2 2 2 3 5 3 5 4 4 5 5 3 3 4 2 2 4 1 1 2 2 2 2 2 3 3 3 3 4 5 …
Output: 26

Example 2:

Input: 1254 3 2 5 5 2 5 2 2 4 3 2 5 1 4 4 1 5 4 4 4 4 4 1 4 3 4 3 2 3 3 4 1 2 3 4 3 1 1 3 5 3 5 5 5 5 5 4 1 2 3 4 1 4 3 5 2 3 4 4 3 2 3 4 2 5 2 3 1 3 2 1 2 5 3 4 1 1 5 3 4 1 3 2 1 5 1 1 3 2 2 4 4 4 2 2 3 4 2 1 4 3 4 1 3 5 3 1 5 1 4 1 5 4 2 2 3 4 3 3 5 2 4 5 4 4 5 5 5 5 5 4 5 2 4 5 1 2 3 1 1 3 1 1 1 3 5 3 4 3 5 2 2 4 3 3 4 4 1 4 4 1 2 2 1 2 4 4 1 4 4 1 4 4 2 2 2 5 1 4 5 4 4 3 1 1 5 5 1 4 5 1 1 3 4 1 2 1 2 5 5 5 1 3 5 1 2 5 2 2 1 1 2 2 5 2 3 4 1 1 4 5 4 4 5 2 3 3 2 3 3 3 5 1 5 3 5 2 3 3 5 2 4 2 4 2 2 1 3 3 3 3 4 3 3 2 3 5 3 3 1 5 1 5 2 4 2 2 2 1 5 4 4 2 1 1 3 3 5 4 3 4 2 4 4 2 1 5 2 4 1 5 5 4 4 2 4 5 1 3 1 5 5 3 4 2 2 2 3 5 3 5 4 3 5 2 1 5 4 5 2 1 3 2 5 2 5 3 2 2 1 1 5 5 4 5 2 2 1 3 3 2 4 1 2 2 1 3 4 3 4 3 1 3 4 2 5 3 1 2 2 4 4 2 4 5 2 2 4 5 3 4 2 2 4 1 3 2 3 2 5 4 4 3 5 1 4 3 4 3 3 2 1 1 1 5 3 2 5…
Output: 26

Example 3:

Input: 1528 5 3 1 5 5 5 5 3 3 4 1 2 5 4 1 4 2 3 4 2 2 2 1 3 5 3 1 4 2 2 2 4 5 4 1 3 1 5 5 1 5 2 5 2 1 4 4 4 1 3 4 4 4 1 4 5 5 2 3 1 5 3 1 4 1 1 4 1 3 3 3 2 2 2 1 4 1 2 5 3 4 5 4 2 5 4 4 4 2 4 1 2 5 1 2 2 5 5 5 1 4 1 1 3 2 1 3 3 5 1 1 4 3 4 4 2 5 3 2 5 4 5 4 3 2 2 1 5 1 1 2 3 5 4 5 2 2 2 3 2 2 5 4 4 4 5 2 5 4 3 5 3 3 5 5 2 1 5 3 5 3 3 4 3 5 2 1 3 5 4 1 4 3 5 5 4 1 4 4 5 5 5 1 3 5 1 1 1 2 5 5 3 1 1 3 4 3 3 5 3 5 3 2 2 4 5 2 4 1 1 4 2 3 4 3 5 4 2 4 5 3 1 3 2 3 3 3 4 2 5 1 4 4 4 4 3 5 1 5 1 1 5 5 1 3 1 2 5 3 4 5 4 3 3 4 1 3 2 2 4 2 1 4 4 1 3 1 2 4 3 4 3 3 4 2 4 2 4 4 5 4 2 3 5 3 5 1 5 1 3 5 5 5 4 1 3 2 1 3 5 4 3 1 1 4 3 4 4 4 2 4 1 4 1 5 3 2 2 1 5 2 5 4 1 3 1 3 3 2 3 1 1 3 4 5 5 4 2 2 3 2 5 1 1 5 3 1 4 5 4 2 3 2 5 2 2 2 4 5 4 5 3 5 2 5 4 2 3 1 3 1 3 3 2 5 3 5 4 4 3 3 3 5 1 5 1 5 1 2 5 3 4 2 5 3 3 4 3…
Output: 28

Constraints:

1 <= n <= 3458; 1 <= a[i] <= 1000.

Loading...
Test Cases:No test cases
No test cases available.
The Zigzag Stretch of the Shimmering stretches - MEDIUM Coding Problem | CodeTikki