From 8476c9baab62da6c975769c63c61f8117b0cb95a Mon Sep 17 00:00:00 2001 From: Jonghwan Lee <123362165+0224LJH@users.noreply.github.com> Date: Tue, 28 Oct 2025 20:08:43 +0900 Subject: [PATCH] =?UTF-8?q?[20251028]=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=EC=88=98=EC=97=B4(large)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...25\234 \354\210\230\354\227\264(large).md" | 79 +++++++++++++++++++ 1 file changed, 79 insertions(+) create mode 100644 "0224LJH/202510/28 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 \354\210\230\354\227\264(large).md" diff --git "a/0224LJH/202510/28 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 \354\210\230\354\227\264(large).md" "b/0224LJH/202510/28 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 \354\210\230\354\227\264(large).md" new file mode 100644 index 00000000..c0b9c3e4 --- /dev/null +++ "b/0224LJH/202510/28 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 \354\210\230\354\227\264(large).md" @@ -0,0 +1,79 @@ +```java +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +public class Main { + + + static int len,totalErase,curErase,start,end,ans,curLen; + static int[] arr; + + public static void main(String[] args) throws IOException { + init(); + process(); + print(); + } + + private static void init() throws IOException{ + BufferedReader br = new BufferedReader(new InputStreamReader(System.in));; + StringTokenizer st = new StringTokenizer(br.readLine()); + len = Integer.parseInt(st.nextToken()); + totalErase = Integer.parseInt(st.nextToken()); + arr = new int[len]; + st = new StringTokenizer(br.readLine()); + for (int i = 0; i < len; i++) { + arr[i] = Integer.parseInt(st.nextToken()); + } + + start = 0; + end = 0; + ans = 0; + curErase = 0; + curLen = 0; + + } + + private static void process() { + if (arr[0] %2 == 0) { + curLen++; + ans++; + } else { + curErase++; + } + + while( end < len) { + if (curErase < totalErase) { + end++; + if (end == len)break; + if (arr[end] %2 == 0) curLen++; + else curErase++; + + } else if (curErase == totalErase && end + 1 < len && arr[end+1]%2 ==0) { + end++; + curLen++; + } else { + if (arr[start] %2 == 0) { + curLen--; + } else { + curErase--; + } + start++; + } + + + + ans = Math.max(ans, curLen); + } + } + + + + private static void print() { + System.out.println(ans); + } +} + + +```