poj 3494单调栈

题意：给你一个矩阵，找他只有1的余子式中，1最多的余子式有多少个1.

输入
4 4 //m和n表示m行n列
0 0 0 0
0 1 1 0
0 1 1 0
0 0 0 0

输出
4

思路：
首先你要明白poj2559是怎么做的，然后如果你只看这个矩阵的第一行，那么他就是poj2559的那个问题，只是每个矩形高度要么是0要么是1。如果你看前两行，那么他也是poj2559的那个问题，以此类推，我相信你懂了

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <map>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long

using namespace std;

int n, m;
int marrix[2111][2111];
int st[2111],l[2111],r[2111];

ll get(int x) {
	if (x != 0) 
		for (int i = 0; i < n; i++) 
			if (marrix[x][i])
				marrix[x][i] += marrix[x - 1][i];

	int *h = marrix[x];
	int t = 0;
	for (int i = 0; i < n; i++) {
		while (t > 0 && h[st[t - 1]] >= h[i])t--;
		l[i] = (t == 0 ? 0 : (st[t - 1] + 1));
		st[t++] = i;
	}
	t = 0;
	for (int i = n - 1; i >= 0; i--) {
		while (t > 0 && h[st[t - 1]] >= h[i])t--;
		r[i] = (t == 0 ? n : st[t - 1]);
		st[t++] = i;
	}

	ll ans = 0;
	for (int i = 0; i < n; i++) 
		ans = max(ans, (ll)h[i] * (r[i] - l[i]));
	return ans;
}

void solve() {
	ll ans = 0;
	for (int i = 0; i < m; i++)
		ans = max(ans, get(i));
	printf("%lld\n", ans);
}

int main() {
	while (scanf("%d%d", &m, &n) != EOF&&n) {
		for (int i = 0; i < m; i++)
			for (int j = 0; j < n; j++)
				scanf("%d", &marrix[i][j]);

		solve();
	}

	return 0;
}