Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 39208 Accepted Submission(s):
17608
#include<stdio.h>
#include<math.h>
int main()
{
int n,m,j,i,l,k,max;
int a[100][100];
while(scanf("%d%d",&m,&n)!=EOF)
{
k=0;l=0;max=0;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
if(abs(a[i][j])>abs(max))
{
max=a[i][j];
k=i;l=j;
}
}
printf("%d %d %d\n",k,l,max);
}
return 0;
}
原文：http://www.cnblogs.com/tonghao/p/4372883.html