5 5 0 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 1 0 0 0 0 1 0 0
10
#include <cstdio> #include <iostream> #include <cmath> #include <string> #include <cstring> #include <algorithm> #include <queue> using namespace std; #define ll long long int n, m, sum, s = 0, f[100+8][100+8]; int main() { scanf("%d%d", &n, &m); for(int i = 0; i<n; i++) { for(int j = 0; j<m; j++) { scanf("%d", &f[i][j]); } } for(int i = 0; i<n; i++) { for(int j = 0; j<m; j++)//一个一个滴搜索鸭 { int miao = n-1, ying = m-1; sum = 0; for(; ying >= 0; ying--)//行 { if(f[i][ying])sum++; } for(; miao >= 0; miao--)//列 { if(f[miao][j])sum++; } if(sum>s)s = sum; } } printf("%d\n", s); return 0; }
原文：https://www.cnblogs.com/RootVount/p/10889726.html