题解 | #最高身高#
最高身高
https://www.nowcoder.com/practice/258fe0c567ac493f9b7bc9d3669d158d
n,m = map(int,input().split())
lines = []
for i in range(n):
temp = list(map(int,input().split()))
lines.extend(temp)
max_num = max(lines)
max_index = lines.index(max_num)
i = (max_index ) // m + 1
j = max_index - (i-1)*m +1
print(i,j)
而且我也做过这个仿小红书，感觉有点太深了短期内不好驾驭啊
怕被问穿