题解

#include<iostream>
using namespace std;
int main(){
int n,max=0;
long long sum;
cin>>n;
int a[n+2][n+2];
int s[n][n];
for(int i=0;i<=n+1;i++){
for(int j=0;j<=n+1;j++){
a[i][j]=1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cin>>a[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
sum=a[i-1][j-1]*a[i-1][j]*a[i-1][j+1]*a[i][j-1]*a[i][j]*a[i][j+1]*a[i+1][j-1]*a[i+1][j]*a[i+1][j+1];
s[i][j]=sum;
if(sum>max){
max=sum;
}
sum=0;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(s[i][j]==max){
cout<<i<<" "<<j;
cout<<"\n";
}
}
}
return 0;
}