#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
int m, n;
while(scanf("%d %d", &m, &n) != EOF)
{
int a[m + 2][n + 2];
int cmax, cmax_i, cmax_j;
for(int i = 1; i <= m; ++ i)
{
for(int j = 1; j <= n; ++ j)
{
scanf("%d", &a[i][j]);
}
}
cmax = a[1][1];
cmax_i = 1;
cmax_j = 1;
for(int i = 1; i <= m; ++ i)
{
for(int j = 1; j <= n; ++ j)
{
if(abs(a[i][j]) > abs(cmax))
{
cmax = a[i][j];
cmax_i = i;
cmax_j = j;
}
}
}
printf("%d %d %d\n", cmax_i, cmax_j, cmax);
}
return 0;
}
Time Limit Exceeded(没有加!=EOF)->Runtime Error(数组开小了)
(ACCESS_VIOLATION)->Accepted