Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Alpha
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?
Input
The first input line contains an integer n
: the number of songs.
The next line has n
integers k1,k2,…,kn
: the id number of each song.
Output
Print the length of the longest sequence of unique songs.
Constraints
Example
Input:
8
1 2 1 3 2 7 4 2
Output:
5
Для отправки решений необходимо выполнить вход.
|