제 코드가 시간복잡도가 더 걸릴까요??

n = int(input())
lst = [list(map(int, input().split())) for _ in range(n)]


maximum = 0

mid = n // 2

for i in range(mid+1):
    maximum += sum(lst[mid-i][i:n-i])

for i in range(1, mid+1):
    maximum += sum(lst[mid+i][i:n-i])

print(maximum)