8646: DSL_3_B : The Smallest Window II
[Creator : ]
Description
For a given array $a_1,a_2,a_3,...,a_N$ of N elements and an integer K, find the smallest sub-array size (smallest window length) where the elements in the sub-array contains all integers in range [1,2,...,K]. If there is no such sub-array, report 0.
Input
The input is given in the following format.
$N\ K$
$a_1\ a_2\ ...\ a_N$
Output
Print the smallest sub-array size in a line.
Constraints
$1≤N≤10^5$
$1≤K≤10^5$
$1≤a_i≤10^5$
$1≤K≤10^5$
$1≤a_i≤10^5$
Sample 1 Input
6 2
4 1 2 1 3 5
Sample 1 Output
2
Sample 2 Input
6 3
4 1 2 1 3 5
Sample 2 Output
3
Sample 3 Input
3 4
1 2 3
Sample 3 Output
0
HINT
相同题目：DSL_3_B。