[백준] 2559번:수열 (Java 자바)

문제

https://www.acmicpc.net/problem/2559

2559번: 수열

 

풀이 및 소스코드

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;

		st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		int res = -(Integer.MAX_VALUE);
		int[] arr = new int[n];
		st = new StringTokenizer(br.readLine());
		for(int i=0;i<n;i++) {
			arr[i] = Integer.parseInt(st.nextToken());
		}
		for(int i=0;i<=n-k;i++) {
			int sum=0;
			for(int j=i;j<i+k;j++) {
				sum +=arr[j];
			}
			res = Math.max(res, sum);
		}
		System.out.println(res);
	}

}