[Python] SWEA 4835 - 구간합

[2022.02.09]

T = int(input())
for tc in range(T):
    N,M = map(int,input().split())
    a = list(map(int,input().split()))

    sums = []
    for i in range(0,N-M+1):
        tmpsum = 0
        for j in range(M):
            tmpsum += a[i+j]
        sums.append(tmpsum)

    maxsum = sums[0]
    minsum = sums[0]

    for i in range(1,len(sums)):
        if maxsum < sums[i]:
            maxsum = sums[i]
        if minsum > sums[i]:
            minsum = sums[i]

    print(f'#{tc+1} {maxsum-minsum}')