题解 | #最高身高#二维数组解法
最高身高
http://www.nowcoder.com/practice/258fe0c567ac493f9b7bc9d3669d158d
二维数组解法,挺简单的,
row,col = map(int,input().split())
a=[[0 for _ in range(0,row+4)]for _ in range(0,col+4)]
for i in range(0,row):
a[i]=list(map(int,input().split()))
max1 = 0
maxi = 0
maxj = 0
for i in range(0,row):
for j in range(0,col):
if(a[i][j]>max1):
max1 = a[i][j]
maxi = i
maxj = j
print(maxi+1,maxj+1)
沟通这么多次哈啰从来没鸟过人
😂