Scanner in = new Scanner(System.in); int n = in.nextInt(); int M = in.nextInt(); int []temp = new int[n+1]; for(int i =0;i<m>k){ if(temp[l]==1) curd--; l++; } } res = Math.max(r-l+1,res); r++; } System.out.println(res);</m>