Longest Distinct Subarray - Classic Problems | Repovive

CLS49. Longest Distinct Subarray

2s256 MB

Given an array of integers, find the maximum length of a contiguous subarray in which every value appears at most once.

\begin{array}{l} n \\ a_1 \quad a_2 \quad \ldots \quad a_n \end{array}

len_{\max}

Input

7
1 2 1 3 4 3 5

Explanation

The longest segment without repeated values is 2 1 3 4, with length 4.

Output

Input

5
9 9 9 9 9

Explanation

Any valid segment can contain only one value, so the answer is 1.

Output

Input

6
-1 0 -1 2 3 4

Explanation

The segment 0 -1 2 3 4 has all distinct values and length 5.

Output

\begin{array}{l} n \\ a_1 \quad a_2 \quad \ldots \quad a_n \end{array}

len_{\max}