题解 | #最高身高#
最高身高
https://www.nowcoder.com/practice/258fe0c567ac493f9b7bc9d3669d158d
#include <stdio.h>
int main()
{
int n, m;
scanf("%d %d", &n, &m);
int arr[n][m];
int max_height = -2147483648;
int max_i, max_j;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
scanf("%d", &arr[i][j]);
if (arr[i][j] > max_height)
{
max_height = arr[i][j];
max_i = i + 1;
max_j = j + 1;
}
}
}
printf("%d %d", max_i, max_j);
return 0;
}
查看6道真题和解析