题解 | #最高身高#
最高身高
https://www.nowcoder.com/practice/258fe0c567ac493f9b7bc9d3669d158d
#include <stdio.h>
int main() {
int n, m, max;
scanf("%d %d", &n, &m);
int arr[n][m], x, y;
for (int i = 0; i < n; i++) {
for (int j = 0 ; j < m; j++) {
scanf("%d ", &arr[i][j]);
}
}
max = arr[0][0];
for (int i = 0; i < n; i++) {
for (int j = 0 ; j < m; j++) {
max = max > arr[i][j] ? max:arr[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0 ; j < m; j++) {
if (max ==arr[i][j]) {
printf("%d %d",i+1,j+1);
return 0;
}
}
}
}
