CF660C Hard Process

You are given an array $ a $ with $ n $ elements. Each element of $ a $ is either $ 0 $ or $ 1 $ . Let's denote the length of the longest subsegment of consecutive elements in $ a $ , consisting of only numbers one, as $ f(a) $ . You can change no more than $ k $ zeroes to ones to maximize $ f(a) $ .

N/A

N/A