백준 21921. 블로그

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

21921번: 블로그

n, x = map(int, input().split())
visited = list(map(int, input().split()))

current_sum = sum(visited[:x])
max_sum = current_sum
cnt = 1

for i in range(1, n-x+1):
    current_sum = current_sum - visited[i-1] + visited[i+x-1]
    if max_sum < current_sum:
        max_sum = current_sum
        cnt = 1
    elif max_sum == current_sum:
        cnt += 1

if max_sum == 0:
    print('SAD')
else:
    print(max_sum)
    print(cnt)

슬라이딩 윈도우