思路:
我们可以用哈希结构,此题适合用字典,键为出现的非零数字,值为列表,列表为【minrow,maxrow,minrol,maxrol]
import sys
def main():
m,n = map(int,input().split())
rects = {
}
for i in range(m):
nums = [int(i) for i in input().split()]
for j in range(n):
if nums[j] > 0:
if nums[j] not in rects:
rects[nums[j]]=[sys.maxsize,-sys.maxsize,sys.maxsize,-sys.maxsize]
rects[nums[j]][0] = min(rects[nums[j]][0],i)
rects[nums[j]][1] = max(rects[nums[j]][1],i)
rects[nums[j]][2]