Min Max Equality

Chef found an array $A$ of $N$ elements. He defines a subarray as *bad* if the maximum element of the subarray is equal to the minimum element of the subarray. More formally, a subarray $[L,R]$ $(1 \le L \le R \le N)$ is *bad* if $\texttt{max}(A_L, A_{L+1}, \ldots , A_R) = \texttt{min} (A_L, A_{L+1}, ... , A_R)$. Chef is allowed to change **at most** $K$ elements of the array. Find the **minim