CT33803

Last scrolls of Uday

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

The store warden Uday has been asked to certify the cargo before shipping. On the desk lies a long table of scrolls readings. 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 <= 1056; 0 <= a[i] <= 1000000.

Example 1:

Input: 752 3 5 2 0 0 1 0 2 5 3 4 5 0 3 0 4 3 3 0 1 1 0 2 4 5 5 5 4 0 5 4 1 2 4 1 5 1 0 1 0 4 1 1 5 4 5 4 2 0 0 5 0 3 0 0 4 4 5 5 3 2 5 3 0 0 2 2 0 0 3 4 3 3 3 0 0 2 4 4 2 3 3 4 1 4 0 1 4 2 4 1 0 5 1 0 4 1 1 4 0 1 2 3 4 4 5 1 0 5 4 2 4 1 4 5 2 2 0 1 3 5 1 1 1 2 1 0 0 3 1 2 3 1 3 3 5 4 5 5 4 0 3 3 0 4 5 4 4 0 0 2 5 4 5 1 1 0 0 0 5 0 0 0 2 5 2 2 3 2 2 1 2 1 1 3 0 5 1 3 3 2 1 2 0 1 1 4 1 3 3 4 5 1 3 2 2 0 2 3 5 2 0 0 4 2 3 3 1 4 4 5 2 4 1 3 0 0 5 4 5 2 2 1 2 2 2 4 0 0 5 0 3 1 3 1 1 4 3 3 5 3 3 1 1 5 4 3 1 0 0 3 5 5 0 3 0 0 3 3 0 3 2 5 4 4 1 3 0 0 5 3 3 4 4 3 0 2 4 2 3 5 4 0 4 3 1 3 4 2 5 2 3 0 4 3 2 4 3 1 0 5 5 0 1 1 0 0 4 3 3 4 0 1 3 2 4 1 5 1 2 4 1 1 2 4 1 1 5 2 3 5 2 3 2 5 0 3 5 4 2 1 5 0 3 1 4 1 4 2 5 5 1 1 0 2 2 0 1 2 4 4 2 4 1 0 0 5 3 1 3 3 4 4 0 4 5 5 3 3 3 0 2 2 0 0 1 5 4 1 1 5 1 5 1 4 0 0 0 …
Output: 28

Example 2:

Input: 275 0 1 0 3 4 3 1 2 3 5 4 1 3 5 1 5 2 5 2 2 4 2 4 3 5 2 2 1 1 3 3 3 2 0 4 5 0 0 1 2 1 1 2 3 3 4 4 5 5 4 0 2 3 3 1 1 3 5 0 1 2 3 5 0 4 3 0 5 4 5 5 4 1 1 4 5 4 1 1 2 2 5 4 3 3 1 5 3 3 1 0 5 5 3 2 3 4 0 4 0 1 5 3 0 1 4 0 3 5 0 0 3 4 5 5 5 5 1 1 3 0 5 5 0 1 2 2 4 2 2 1 4 5 5 2 4 5 2 0 2 2 2 1 0 4 0 4 4 2 2 2 1 3 5 0 5 1 1 1 0 1 4 5 2 0 1 1 0 2 5 2 5 5 1 5 5 5 4 2 3 4 3 1 4 2 0 0 1 3 4 1 1 1 4 1 1 4 0 2 4 2 4 0 1 5 4 5 5 3 0 1 3 3 1 5 2 5 4 4 3 4 2 5 2 3 5 0 5 4 3 3 4 0 3 3 3 0 3 0 0 2 4 2 0 2 3 1 2 0 2 2 4 4 3 4 0 4 5 2 0 5 1 0 5 2 0 1 3 1 4 5 4 3 3 0
Output: 21

Example 3:

Input: 1054 5 4 5 1 3 5 3 3 2 2 0 2 2 5 2 2 3 0 1 2 4 0 2 0 1 5 2 1 5 2 2 2 5 1 1 2 4 1 1 2 3 3 4 1 2 3 0 2 5 5 2 5 2 4 4 0 0 5 2 4 2 5 4 0 4 4 3 5 0 0 5 0 2 4 2 3 1 1 4 4 5 4 3 5 4 1 1 2 1 5 4 0 0 0 3 4 0 2 1 5 1 3 4 3 3 0 3 4 3 5 5 5 4 1 2 1 3 3 4 3 3 0 0 3 2 1 3 3 2 5 5 2 2 2 1 3 1 2 0 3 1 4 3 5 3 5 3 4 1 4 4 2 0 4 2 0 0 3 2 2 3 1 4 2 5 4 4 4 3 4 3 0 2 0 1 4 5 5 1 4 2 0 3 4 3 5 2 3 0 4 1 2 3 4 3 3 5 1 1 4 2 5 0 5 4 1 1 4 5 3 3 1 4 3 4 5 1 0 2 2 1 0 3 5 3 2 3 2 2 5 1 3 2 1 0 3 3 5 4 2 3 2 2 2 4 0 4 2 0 2 2 5 1 4 5 1 5 3 5 0 5 0 1 0 1 2 3 0 5 5 1 1 3 3 3 0 1 0 2 4 5 4 2 0 4 5 2 4 1 0 0 1 4 0 2 5 2 0 5 0 0 2 0 4 3 5 0 0 0 0 5 1 4 2 5 0 1 5 3 1 5 3 0 4 3 3 4 1 0 4 2 3 0 0 5 1 0 2 0 2 4 1 0 0 2 0 1 5 5 1 3 3 2 1 1 0 5 3 4 5 5 4 5 3 3 0 0 1 2 2 5 2 3 1 5 5 0 4 3 2 3 1 0 1 4 3 5 3 5 5 3 1 1 2 4 1 3 2…
Output: 32

Constraints:

1 <= n <= 1056; 0 <= a[i] <= 1000000.

Loading...
Test Cases:No test cases
No test cases available.