[정올 2497] 수열

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1758&sca=99&sfl=wr_hit&stx=2497 

JUNGOL

#include <stdio.h>
int N, K, A[100100], Sum[100110], max;
int main(void)
{
	int subsum = 0;
	scanf("%d %d", &N, &K);
	for (int i = 1; i <= N; i++) {
		scanf(" %d", A + i);
	}
	for (int i = 1; i <= K; i++) { Sum[K] += A[i]; }
	max = Sum[K];
	for (int i = K; i < N; i++) {
		Sum[i + 1] = Sum[i] + A[i + 1] - A[i - K + 1];
		if (Sum[i + 1] > max) max = Sum[i + 1];
	}
	printf("%d\n", max);

	return 0;
}