题解

#include<iostream>
using namespace std;
int a[200][200],v[200][200],mx=-1;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cin>>a[i][j];
}
}
for(int i=0;i<=n;i++){
a[0][i]=a[n+1][i]=a[i][0]=a[i][n+1]=1;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
v[i][j]=a[i][j]*a[i-1][j]*a[i+1][j]*a[i][j-1]a[i][j+1];
v[i][j]=a[i-1][j-1]*a[i-1][j+1]*a[i+1][j-1]*a[i+1][j+1];
mx=max(v[i][j],mx);
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(v[i][j]==mx) cout<<i<<" "<<j<<endl;
}
}
}