【HDU】2021杭电暑假集训营（第一场):Maximal submatrix 单调栈

传送门

题意

求一个最大的矩阵面积，要求这个矩阵的每一列都是不下降的

分析

我们去维护每一列满足条件的长度，如果$a[i][j]>a[i-1][j]$，那么$f[i][j]=f[i-1][j]+1$，否则$f[i][j]=1$
然后我们去枚举每一行每一列，以这个点向下最长的长度可以占多少格，类似于单调栈求矩阵最大面积那个题，维护一个$l[i]$和$r[i]$即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 5e3 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N][N];
int f[N][N];
int l[N], r[N];
int q[N];
int n, m;

int check(int h[]) {
	h[0] = h[m + 1] = -1;
	int tt = -1;
	q[++ tt] = 0;
	for (int i = 1; i <= m; i ++)
	{
		while (h[q[tt]] >= h[i])  tt --;
		l[i] = q[tt] + 1;
		q[++ tt] = i;
	}
	tt = -1;
	q[++ tt] = m + 1;
	for (int i = m; i; i --)
	{
		while (h[q[tt]] >= h[i])  tt --;
		r[i] = q[tt] - 1;
		q[++ tt] = i;
	}
	int res = 0;
	for (int i = 1; i <= m; i ++)  res = max(res, h[i] * (r[i] - l[i] + 1));
	return res;
}

int main() {
	int T;
	read(T);
	while (T--) {
		read(n), read(m);
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				read(a[i][j]);
				if (a[i][j] >= a[i - 1][j]) f[i][j] = f[i - 1][j] + 1;
				else f[i][j] = 1;
			}
		}
		int ans = 0;
		for (int i = 1; i <= n; i++)
			ans = max(ans, check(f[i]));
		di(ans);
	}

}