[SWEA] 파리 퇴치 (python)

https://swexpertacademy.com/main/code/problem/problemDetail.do

SW Expert Academy

 

나보다 더 시간 복잡도가 낮게 푸신 분들도 많을 것 같다 (그냥 반복문 마구마구 돌렸기에)

 

T = int(input())
 
for t in range(T):
    n, m = map(int, input().split())
    graph = []
 
    for i in range(n):
        tmp = list(map(int, input().split()))
        graph.append(tmp)
     
    answer = 0
 
    for i in range(n-m+1):
        for j in range(n-m+1):
            tmp_answer = 0
            for q in range(i, i+m):
                for k in range(j, j+m):
                    tmp_answer += graph[q][k]
            answer = max(answer, tmp_answer)
 
    print(f"#{t+1} {answer}")