algorithm/백준
백준 2435 Java 자바
umilove98
2021. 8. 30. 14:14
반응형
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Q2435 {
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());
StringTokenizer num = new StringTokenizer(br.readLine());
int[] arr = new int[n];
for(int i = 0; i < n; i++) {
arr[i] = Integer.parseInt(num.nextToken());
}
int max = -2147483648;
for(int i = 0; i <= n-k; i++) {
int now = 0;
for(int j = 0; j < k; j++) {
now += arr[i+j];
}
if(now > max) {
max = now;
}
}
System.out.println(max);
}
}
|
cs |
반응형