很简单,用一个二维数组很容易做出,
主要要注意二维数组a[m][n],m是指行,n是指列,
以下是代码:
#include <stdio.h>
#include <iostream>
using namespace std;
int main()
{
int n, m, a[100][100];
while (cin >> n >> m)
{
for (int i = 1; i <= n; i ++)
{
for (int j = 1; j <= m; j ++)
{
cin >> a[i][j];
}
}
int max = a[1][1],s1 = 1, s2 = 1;
for (int x = 1; x <= n; x ++)
{
for (int y = 1; y <= m; y ++)
{
if (abs(a[x][y]) > abs(max))
{
max = a[x][y];
s1 = x;
s2 = y;
}
}
}
printf ("%d %d %d\n", s1, s2, max);
}
system ("pause");
return 0;
}