연속해서 가장 긴 수

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt(); // 배열의 크기
        int change = sc.nextInt();

        int[] arr = new int[N];
        for(int i = 0 ; i < N; i++){
            arr[i] = sc.nextInt();
        }


        Main T = new Main();
        System.out.println(T.solution(change, arr));

    }

    public int solution(int k, int[] arr){
        int anwser = 0;
        int cnt = 0;
        int p2 = 0;


        for(int p1 = 0; p1 < arr.length; p1++){
            if(arr[p1] == 0){
                cnt++;
            }

            while (cnt > k){
                if(arr[p2] == 0){
                    cnt--;
                }
                p2++;
            }

            anwser = Math.max(anwser, p1-p2+1);
        }

      return anwser;
    }
}