\(3^{rd}\) round, November \(28^{th}\) 2015
"Hey! I have an awesome task with chameleons, \(5^{th}\) task for Saturday’s competition."
"Go ahead. . . "
(...)
“That’s too difficult, I have an easier one, they won’t even solve that one.”
“You are given an array of \(N\) integers from the interval [1, K]. You need to process \(M\) queries. The first
type of query requires you to change a number in the array to a different value, and the second type of
query requires you to determine the length of the shortest contiguous subarray of the current array
that contains all numbers from 1 to \(K\).”
“Hm, I can do it in \(O\)(\(N\)^{6}). What’s the limit for \(N\)?”

In test cases worth 30% of total points, it will hold 1 ⩽N, M ⩽5 000.

The first line of input contains the integers \(N\), \(K\) and \(M\) (1 ⩽N, M ⩽100 000, 1 ⩽\(K\) ⩽50). The
second line of input contains \(N\) integers separated by space, the integers from the array. After that,
\(M\) queries follow, each in one of the following two forms:
• “1 \(p\) \(v\)” - change the value of the \(p\)^{th} number into \(v\) (1 ⩽\(p\) ⩽N, 1 ⩽\(v\) ⩽\(K\))
• “2” - what is the length of the shortest contiguous subarray of the array containing all the integers
from 1 to \(K\)

The output must consist of the answers to the queries of the second type, each in its own line.
If the required subarray doesn’t exist, outp\(ut - 1\).

생성자가 기록되지 않았습니다.

출처 COCI 2015/2016 Contest 3