题解
2023-08-13 11:23:18
发布于:广东
0阅读
0回复
0点赞
#include <bits/stdc++.h>
using namespace std;
int a[200][200],v[200][200];
int main(){
int n,mx;
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];
v[i][j] *= a[i][j+1] * 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;
}
}
return 0;
}
这里空空如也
有帮助,赞一个