definput_matric(): str_in = input() row,column = [int(x) for x in str_in.split()] # m = [[0for i in range(column+2)] for j in range(row+2)] # 初始化矩阵
# print(m) # 传入各个位置的值 for i in range(row): str_i = input() i_row = [int(w) for w in str_i.split()] for j in range(column): m[i+1][j+1] = i_row[j] return m
for i in range(row-2): for j in range(column-2): left = mtx[i+1][j] right = mtx[i+1][j+2] val = mtx[i+1][j+1] up = mtx[i][j+1] down = mtx[i+2][j+1] sum = left + right + val + up + down #上下左右所有值加起来
if sum > sum_max: sum_max = sum max_position[0] = [i,j] # 真正的位置在(i,j)这个坐标下 elif sum == sum_max: max_num = max_num +1 max_position.append([i,j]) print(str(sum_max) + " " + str(max_num)) for k in range(len(max_position)): print(str(max_position[k][0]) + " " + str(max_position[k][1])) # 找到对应位置的值以及和它相邻位置的值,然后传参计算值 # 这里为了方便计算、找值把矩阵扩充为(row+2)*(column+2)