题解 | All-one Matrices-2019牛客暑期多校训练营第八场A题

题目来源于牛客竞赛：https://ac.nowcoder.com/acm/contest/discuss
题目描述：

输入描述：

输出描述：

示例1：

题解：

代码：

#include <cstdio>
#include <algorithm>
using namespace std;
#define N 3000 + 5

int n, m, ans, Map[N][N], Sum[N][N], Up[N][N], Stack[N], Height[N];
char s[N];

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i ++)
	{
		scanf("%s", s + 1);
		for (int j = 1; j <= m + 1; j ++)
		{
			Map[i][j] = j <= m ? (s[j] == '1') : 0;
			Sum[i][j] = Sum[i][j - 1] + Map[i][j];
			Up[i][j] = Map[i][j] ? Up[i - 1][j] + 1 : 0;
		}
	}
	for (int i = 1; i <= n; i ++)
		for (int j = 1, sz = 0; j <= m + 1; j ++)
		{
			int last = j;
			for (; sz && Height[sz] > Up[i][j]; sz --)
			{
				if (i == n || (Sum[i + 1][j - 1] - Sum[i + 1][Stack[sz] - 1]) < j - Stack[sz]) ans ++;
				last = Stack[sz];
			}
			if (Up[i][j] && (!sz || Height[sz] < Up[i][j]))
				Stack[++ sz] = last, Height[sz] = Up[i][j];
		}
	printf("%d\n", ans);
	return 0;
}

更多问题，更详细题解可关注牛客竞赛区，一个刷题、比赛、分享的社区。
传送门：https://ac.nowcoder.com/acm/contest/discuss