From 839bdffc5c4fc72971574b11758d4c7774588938 Mon Sep 17 00:00:00 2001
From: LiiNi-coder <97495437+LiiNi-coder@users.noreply.github.com>
Date: Tue, 30 Sep 2025 22:58:09 +0900
Subject: [PATCH] =?UTF-8?q?[20250930]=20BOJ=20/=20G5=20/=20=EA=B0=80?=
 =?UTF-8?q?=EC=9E=A5=20=EA=B8=B4=20=EC=A7=9D=EC=88=98=20=EC=97=B0=EC=86=8D?=
 =?UTF-8?q?=ED=95=9C=20=EB=B6=80=EB=B6=84=20=EC=88=98=EC=97=B4=20(large)?=
 =?UTF-8?q?=20/=20=EC=9D=B4=EC=9D=B8=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...6\204 \354\210\230\354\227\264 (large).md" | 44 +++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 "LiiNi-coder/202509/30 BOJ \352\260\200\354\236\245 \352\270\264 \354\247\235\354\210\230 \354\227\260\354\206\215\355\225\234 \353\266\200\353\266\204 \354\210\230\354\227\264 (large).md"

diff --git "a/LiiNi-coder/202509/30 BOJ \352\260\200\354\236\245 \352\270\264 \354\247\235\354\210\230 \354\227\260\354\206\215\355\225\234 \353\266\200\353\266\204 \354\210\230\354\227\264 (large).md" "b/LiiNi-coder/202509/30 BOJ \352\260\200\354\236\245 \352\270\264 \354\247\235\354\210\230 \354\227\260\354\206\215\355\225\234 \353\266\200\353\266\204 \354\210\230\354\227\264 (large).md"
new file mode 100644
index 00000000..006ad163
--- /dev/null
+++ "b/LiiNi-coder/202509/30 BOJ \352\260\200\354\236\245 \352\270\264 \354\247\235\354\210\230 \354\227\260\354\206\215\355\225\234 \353\266\200\353\266\204 \354\210\230\354\227\264 (large).md"	
@@ -0,0 +1,44 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int n = Integer.parseInt(st.nextToken());
+        int k = Integer.parseInt(st.nextToken());
+        int[] arr = new int[n];
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+        int left = 0, right = 0;
+        int odd = 0;
+        int evenCount = 0;
+        int answer = 0;
+        while(right < n) {
+            if (arr[right] % 2 == 0) {
+                evenCount++;
+            }else {
+                odd++;
+            }
+            right++;
+
+            while(odd > k){
+                if(arr[left] % 2== 0) {
+                    evenCount--;
+                } else {
+                    odd--;
+                }
+                left++;
+            }
+            answer = Math.max(answer, evenCount);
+        }
+        
+        
+        System.out.println(answer);
+    }
+}
+
+```