考级时的我
2026-03-22 21:51:04
发布于：四川
考级时写了120多行*山代码
全部评论 3
#include<bits/stdc++.h>
using namespace std;
int a[105][105];
int main(){
int m,n,cnt=0;cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>a[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(i1){
if(j1){
if(a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j+1]&&a[i][j]<=a[i+1][j+1]){
cnt++;
}
}else if(jm){
if(a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j-1]&&a[i][j]<=a[i+1][j-1]){
cnt++;
}
}else{
if(a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j-1]&&a[i][j]<=a[i][j+1]&&a[i][j]<=a[i+1][j-1]&&a[i][j]<=a[i+1][j+1]){
cnt++;
}
}
}else if(in){
if(j1){
if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i][j+1]&&a[i][j]<=a[i-1][j+1]){
cnt++;
}
}else if(jm){
if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i][j-1]&&a[i][j]<=a[i-1][j-1]){
cnt++;
}
}else{
if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i][j-1]&&a[i][j]<=a[i][j+1]&&a[i][j]<=a[i-1][j-1]&&a[i][j]<=a[i-1][j+1]){
cnt++;
}
}
}else if(j1){
if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j+1]&&a[i][j]<=a[i-1][j+1]&&a[i][j]<=a[i+1][j+1]){
cnt++;
}
}else if(jm){
if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j-1]&&a[i][j]<=a[i-1][j-1]&&a[i][j]<=a[i+1][j-1]){
cnt++;
}
}else{
if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j-1]&&a[i][j]<=a[i][j+1]&&a[i][j]<=a[i-1][j-1]&&a[i][j]<=a[i-1][j+1]&&a[i][j]<=a[i+1][j-1]&&a[i][j]<=a[i+1][j+1]){
cnt++;
}
}
}
}
cout<<cnt;
return 0;
}找到你的同类了！2026-04-19 来自 上海
0
有帮助，赞一个