CT24777

Felix's Tempest Ledger

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

At the lantern lake of Firefly Mere, Felix records each panels in a worn leather ledger. The guild wants answers, not guesses. 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 <= 920; 1 <= a[i] <= 1000000000.

Example 1:

Input: 301 5 3 5 2 3 3 1 5 1 2 2 5 2 3 5 3 5 3 2 5 2 5 3 2 3 2 5 2 4 5 3 3 2 1 4 3 2 4 2 3 1 2 2 3 5 4 2 3 4 4 1 2 1 4 5 3 4 2 2 3 2 4 1 4 4 3 5 5 5 4 5 5 5 1 5 1 3 4 5 3 2 2 5 2 2 5 2 3 3 3 3 2 2 5 5 1 5 5 1 5 1 3 5 5 5 4 3 4 2 5 1 3 3 4 5 2 4 4 5 2 1 5 2 3 4 4 2 2 1 3 5 4 3 5 3 1 1 3 3 1 5 2 5 5 3 3 4 3 5 2 3 3 1 2 2 2 1 3 3 2 4 3 3 1 3 3 5 4 3 3 3 5 4 5 3 5 4 2 1 3 1 1 5 4 1 1 3 3 4 3 1 2 4 5 1 5 1 4 4 5 1 2 4 3 3 5 3 2 3 5 3 5 3 1 2 5 3 3 3 1 4 3 2 1 5 2 5 3 5 3 4 3 1 3 5 4 4 1 5 4 1 1 3 1 1 5 4 3 3 5 4 4 4 5 2 4 5 5 5 2 1 4 5 5 4 5 1 5 2 3 2 1 5 1 2 2 5 4 5 5 5 5 2 3 3 2 4 1 1 2 1 2 2 3 5 1 2 1 4 5 4
Output: 21

Example 2:

Input: 640 2 5 5 1 3 5 4 4 5 1 4 4 1 4 2 4 2 1 4 3 5 4 2 4 3 4 2 2 2 4 5 4 3 4 5 4 3 1 3 1 4 2 3 4 3 1 4 5 3 1 5 2 4 4 3 5 5 4 4 4 1 4 5 2 2 5 5 4 4 5 1 5 1 3 4 4 1 5 2 1 2 2 5 1 1 1 1 1 2 5 2 1 5 3 4 5 3 2 4 2 3 2 5 2 1 5 5 4 2 4 2 5 4 1 4 3 1 4 1 4 1 2 5 2 5 1 5 4 1 5 5 1 5 3 2 5 4 1 4 5 2 1 2 4 3 2 4 1 3 5 2 4 5 3 5 4 2 4 4 2 4 4 5 4 2 4 5 5 2 1 5 4 4 3 5 4 1 3 4 4 3 3 2 4 1 4 5 1 5 2 4 1 2 4 1 5 5 5 1 3 5 4 4 3 2 1 5 1 1 2 4 1 4 4 2 4 2 5 3 4 3 1 5 2 1 3 1 2 2 4 5 5 2 4 3 2 5 4 1 5 2 2 3 1 2 2 2 2 4 4 5 3 4 2 2 3 3 3 2 1 4 4 1 2 1 3 5 1 4 2 5 1 5 3 4 3 4 1 4 1 2 4 1 5 4 1 3 2 1 2 3 5 3 2 1 3 2 1 1 1 2 1 1 4 2 4 5 2 3 2 2 1 5 3 2 4 2 4 1 4 1 2 1 3 2 5 3 2 2 3 3 2 1 4 5 2 5 5 5 1 2 4 4 2 1 5 1 1 5 4 4 1 3 4 3 5 3 4 5 5 5 4 3 5 4 5 1 1 5 2 5 4 2 3 4 4 4 3 3 3 5 3 5 5 5 2 5 5 3 5 5 3 2 3 1 3 1 4 …
Output: 37

Example 3:

Input: 785 2 4 1 4 3 5 3 2 2 2 3 3 4 1 4 4 5 3 5 5 4 5 3 1 3 3 1 4 5 3 1 5 5 3 3 2 3 2 4 5 1 5 3 1 2 4 3 1 1 2 1 2 4 5 2 2 4 3 4 3 2 3 2 4 5 5 5 4 4 5 3 2 5 2 4 4 2 3 3 2 2 1 4 4 1 3 1 3 5 1 1 5 4 1 4 5 1 4 4 5 2 2 1 4 5 5 4 3 2 4 4 1 2 1 2 2 4 5 2 1 3 4 3 5 2 3 2 3 2 5 3 2 2 4 3 5 2 3 3 2 2 1 4 5 1 1 3 5 2 2 5 2 4 3 1 2 5 1 3 5 4 2 4 3 2 5 2 2 5 3 2 2 3 5 1 2 5 2 2 1 2 2 5 1 1 3 1 5 1 1 4 1 1 5 4 2 3 5 5 1 2 3 4 1 4 1 5 4 2 5 1 3 4 4 3 1 2 5 3 3 1 5 5 5 1 5 3 4 1 1 5 1 3 3 3 4 1 1 2 4 3 5 3 5 2 4 1 2 4 4 5 2 1 5 1 5 3 1 3 4 3 5 2 3 3 1 3 1 5 4 2 4 1 3 2 4 5 4 1 4 2 3 3 2 4 2 4 2 5 1 3 4 5 2 4 3 2 2 4 1 4 4 5 3 3 1 5 5 2 4 2 1 5 2 1 3 4 5 5 2 1 5 5 1 5 2 4 1 5 5 5 1 2 3 4 4 3 4 1 1 3 1 5 2 3 3 4 5 3 1 5 4 5 1 3 3 2 4 5 2 5 1 5 4 2 4 5 5 1 3 4 3 2 2 1 4 1 2 2 5 3 5 4 3 2 2 4 1 4 1 5 1 2 1 4 3 2 3 …
Output: 24

Constraints:

1 <= n <= 920; 1 <= a[i] <= 1000000000.

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