T = int(input())
for t in range(1, T+1):
N, M = map(int, input().split())
MAP = []
for i in range(N):
MAP.append(list(map(int, input().split())))
total_map = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(1, N + 1):
total_map[i][j] = MAP[i - 1][j - 1] + total_map[i - 1][j] + total_map[i][j - 1] - total_map[i - 1][j - 1]
result = total_map[M][M]
for i in range(M, N + 1):
for j in range(M, N + 1):
total = total_map[i][j] - total_map[i - M][j] - total_map[i][j - M] + total_map[i - M][j - M]
if total > result:
result = total
print('#{} {}'.format(t, result))
'알고리즘 문제 풀이 > SWEA' 카테고리의 다른 글
[SWEA 1966 python] 숫자를 정렬하자 (0) | 2021.08.13 |
---|---|
[SWEA 1210 python] Ladder1 (0) | 2021.08.13 |
[SWEA 1209 python] Sum (0) | 2021.08.13 |
[SWEA 1954 python] 달팽이 숫자 (0) | 2021.08.13 |
[SWEA 1945 python] 간단한 소인수분해 (0) | 2021.08.13 |