This problem is a Mooshak version of a CSES problem with relaxed time limit (2s) so that Java solutions with the desired complexity can pass.
You are given a playlist of a radio station since its establishment. The playlist has a total of \(n\) songs.
What is the longest sequence of successive songs where each song is unique?
The first input line contains an integer \(n\) the number of songs.
The next line has \(n\) integers \(k_1,k_1,\ldots,k_n\): the id number of each song.
Print the length of the longest sequence of unique songs.
| Example Input | Example Output |
8 1 2 1 3 2 7 4 2 |
5 |