#include <iostream>
#include <cstring>
using namespace std;

int a[1005][1005];
int row[1005];
int column[1005];

int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= n; j++) 
	{
		cin >> a[i][j];
		row[i] += a[i][j];
		column[j] += a[i][j];
	}
	
	int maxv = -1;
	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= n; j++)
		if (!a[i][j])
			maxv = max(maxv, row[i] + column[j]);

	cout << maxv << endl;
	return 0;
}

这个代码AC了。没有判断Bad Game！ @MedalPluS @chen_zhe