package question;

/**
 * @author Roderland
 * @since 1.0
 */
public class Question1004 {
 public static void main(String[] args) {
 System.out.println(new Question1004().longestOnes(new int[]{0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1}, 3));
 }
 public int longestOnes(int[] A, int K) {

 int left=0;
 int right=0;
 int count=0;
 int max=0;
 while (right<A.length) {
 if (A[right++]==0) {
 if (count>=K) {
 while (A[left++]==1);
 } else {
 count++;
 }
 }
 max=Math.max(max, right-left);
 }
 return max;
 }
}