Given a binary array, you may flip at most k of its zeros to ones. Find the length of the longest contiguous block of ones you can obtain.
Input format
Line 1: two integers n and k.
Line 2: n space-separated integers, each 0 or 1 (present whenever n >= 1).
Output format
One line: the maximum length of a contiguous run of ones after flipping at most k zeros.
Constraints
- 1 <= n <= 100000
- 0 <= k <= n
- Each value is 0 or 1.