为啥第三题python暴力只能通过10%，代码有什么问题吗 ``` def solve(score, n, m): # n行m列 (41276)# 前缀和 preSum = [[0] * (m+1) for _ in range(n+1)] for i in range(1, n+1): for j in range(1, m+1): preSum[i][j] = preSum[i][j-1] + preSum[i-1][j] + score[i-1][j-1] - preSum[i-1][j-1] res = preSum[-1][-1] total = preSum[-1][-1] max_len = min(n, m) for l in range(1, max_len+1): # l是边长 l -= 1 for i in range(1, n+1-l): for j in range(1, m+1-l): cur_sum = preSum[i+l][j+l] - preSum[i+l][j-1] - preSum[i-1][j+l] + preSum[i-1][j-1] res = min(res, abs(total - 2*cur_sum)) return res n, m = map(int, input().split()) score = [[] for _ in range(n)] for i in range(n): score[i] = list(map(int, input().split())) print(solve(score, n, m)) ```