Jessica's Reading Problem
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 11032 Accepted: 3718
Description
Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little timeonit. If she wants to pass it, she has to master all ideas included in a very thick text book. The author ofthattext book, like other authors, is extremely fussy aboutthe ideas, thus some ideas are covered more than once. Jessica think if she managed toread each idea at least once, she can pass the exam. She decides toread only one contiguous part ofthe book which contains all ideas covered bythe entire book. And of course, the sub-book should be as thin as possible.
A very hard-working boy had manually indexed for her each page of Jessica's text-book with what idea each page isaboutand thus made a big progress for his courtship. Here you come into save your skin: giventhe index, help Jessica decide which contiguous part she should read. For convenience, each idea has been coded with an ID, which is a non-negative integer.
Input
The first line of input is an integer P (1 ≤ P ≤ 1000000), which isthenumberof pages of Jessica's text-book. The second line contains P non-negative integers describing what idea each page isabout. The firstintegeris what thefirst page isabout, thesecondintegeris what thesecond page isabout, and so on. You may assume all integers that appear can fit well inthe signed 32-bit integer type.
Output
Output one line: thenumberof pages ofthe shortest contiguous part ofthe book which contains all ideals covered inthe book.
Sample Input
518881
Sample Output
2
Source
POJ Monthly--2007.08.05, Jerry