刘嘉柚 • 1年前
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define N 105
#define fi for(int i=1;i<=n;i++)
#define fj for(int j=1;j<=m;j++)
int a[N][N],maxn=-INF;
using namespace std;
int main(){
int n,m,temp1,temp2;
scanf("%d%d",&n,&m);
fi{
fj{
cin>>a[i][j];
if(a[i][j]>maxn){
maxn=a[i][j];
temp1=i,temp2=j;
}
}
}
cout<<maxn<<" "<<temp1<<" "<<temp2;
return 0;
}
评论: