Skip to content

Commit 839bdff

Browse files
authored
[20250930] BOJ / G5 / 가장 긴 짝수 연속한 부분 수열 (large) / 이인희
1 parent a7f963e commit 839bdff

File tree

1 file changed

+44
-0
lines changed

1 file changed

+44
-0
lines changed
Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
```java
2+
import java.io.*;
3+
import java.util.*;
4+
5+
public class Main {
6+
public static void main(String[] args) throws IOException {
7+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
8+
StringTokenizer st = new StringTokenizer(br.readLine());
9+
int n = Integer.parseInt(st.nextToken());
10+
int k = Integer.parseInt(st.nextToken());
11+
int[] arr = new int[n];
12+
st = new StringTokenizer(br.readLine());
13+
for (int i = 0; i < n; i++) {
14+
arr[i] = Integer.parseInt(st.nextToken());
15+
}
16+
int left = 0, right = 0;
17+
int odd = 0;
18+
int evenCount = 0;
19+
int answer = 0;
20+
while(right < n) {
21+
if (arr[right] % 2 == 0) {
22+
evenCount++;
23+
}else {
24+
odd++;
25+
}
26+
right++;
27+
28+
while(odd > k){
29+
if(arr[left] % 2== 0) {
30+
evenCount--;
31+
} else {
32+
odd--;
33+
}
34+
left++;
35+
}
36+
answer = Math.max(answer, evenCount);
37+
}
38+
39+
40+
System.out.println(answer);
41+
}
42+
}
43+
44+
```

0 commit comments

Comments
 (0)