[ZJOI2007]棋盘制作 单调队列

Description
给你一个01矩阵，一个子矩阵能被作为棋盘当且仅当相邻两个点颜色不同。
现在询问你最大的正方形棋盘和最大的矩阵棋盘的面积。

---

Sample Input
3 3
1 0 1
0 1 0
1 0 0

---

Sample Output
4
6

---

矩阵的是单调栈套路题，
正方形的话二分一下吧。

---

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long LL;
int _min(int x, int y) {return x < y ? x : y;}
int _max(int x, int y) {return x > y ? x : y;}
int read() {
	int s = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
	return s * f;
}

struct node {
	int x, y;
} sta[2100]; int tp;
int n, m, mp[2100][2100], up[2100][2100];

bool check(int mid) {
	for(int i = 1; i <= n; i++) {
		int l = 1, r = 0, last = 1;
		for(int j = 1; j <= m; j++) {
			if(mp[i][j] == mp[i][j - 1] && j != 1) last = j, tp = 0;
			while(l <= r && up[i][j] <= sta[r].x) r--;
			sta[++r].x = up[i][j], sta[r].y = j;
			while(l <= r && j - sta[l].y + 1 > mid) l++;
			if(sta[l].x >= mid && j - last + 1 >= mid) return 1;
		}
	} return 0;
}

int main() {
	n = read(), m = read();
	for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) {
		mp[i][j] = read();
	} for(int i = 1; i <= m; i++) up[1][i] = 1;
	for(int i = 2; i <= n; i++) for(int j = 1; j <= m; j++){
		if(mp[i - 1][j] != mp[i][j]) up[i][j] = up[i - 1][j] + 1;
		else up[i][j] = 1;
	} int ans1 = 0;
	for(int i = 1; i <= n; i++) {
		tp = 0;
		for(int j = 1; j <= m; j++) {
			int w = 0;
			if(mp[i][j] == mp[i][j - 1]) {
				while(tp) w += sta[tp].y, ans1 = _max(ans1, sta[tp].x * w), --tp;
			} w = 0;
			while(tp && sta[tp].x >= up[i][j]) w += sta[tp].y, ans1 = _max(ans1, sta[tp].x * w), --tp;
			sta[++tp].x = up[i][j], sta[tp].y = w + 1;
		} int w = 0;
		while(tp) w += sta[tp].y, ans1 = _max(ans1, sta[tp].x * w), --tp;
	}
	int l = 1, r = _min(n, m), ans2 = 1;
	while(l <= r) {
		int mid = (l + r) / 2;
		if(check(mid)) l = mid + 1, ans2 = mid * mid;
		else r = mid - 1;
	} printf("%d\n%d\n", ans2, ans1);
	return 0;
}