A 枚举左上角点 判断右下角是否越界 和=2即可 #include <bits/stdc++.h> using namespace std; const int N = 110; char a[N][N]; int n, m; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) cin >> a[i][j]; } int ans = 0; for (int i = 1; i <= n; i++) { for...