简答题
适中
#24776
山之谷
山之谷



答案与解析
正确答案:<pre class="brush:cpp;toolbar:false">#include <iostream>
using namespace std;
int main() {
int n, m;
int h[105][105];
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> h[i][j];
}
}
for (int i = 0; i <= max(n, m) + 1; i++) {
h[i][0] = h[0][i] = h[i][m + 1] = h[n + 1][i] = 1e9;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
bool ok = true;
for (int i2 = i - 1; i2 <= i + 1; i2++) {
for (int j2 = j - 1; j2 <= j + 1; j2++) {
if (h[i][j] > h[i2][j2]) {
ok = false;
break;
}
}
if (!ok) break; // 补充:内层判断失败,直接跳出i2循环(原代码缺少这一行,逻辑有bug!)
}
ans += ok;
}
}
cout << ans;
return 0;
}</pre><p><br/></p>
这道题暂未补解析。