牛客多校第三场Planting Trees

根据final队的大佬说，找一个矩形的方法往往是 枚举上下边界 得到一个n^3 或n^3logn 的算法。

之前做过一道固定矩形长度的二维优先队列，我一开始用的那个思路枚举边界长度，结果T掉了，原因是这样会有一个2的常数。

所以这题的最终做法就是 枚举上下边界，然后变成一个一维优先队列的问题。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 505;
int a[maxn][maxn],mn[maxn],mx[maxn],Q1[maxn],Q2[maxn];
int main(){
    int n,m,T;
    scanf("%d",&T);
    while(T--) {
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                scanf("%d", &a[i][j]);
            }
        }
        int ans = 0;
        int head1, tail1, head2, tail2;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) mn[j] = mx[j] = a[i][j];
            for (int j = i; j <= n; j++) {
                int last = 1;
                head1 = head2 = 1;
                tail1 = tail2 = 0;
                for (int k = 1; k <= n; k++) {
                    mn[k] = min(mn[k], a[j][k]);
                    mx[k] = max(mx[k], a[j][k]);
                    while (head1 <= tail1 && Q1[head1] < last)head1++;
                    while (head2 <= tail2 && Q2[head2] < last) head2++;
                    while (head1 <= tail1 && mn[k] <= mn[Q1[tail1]]) tail1--;
                    while (head2 <= tail2 && mx[k] >= mx[Q2[tail2]]) tail2--;
                    Q1[++tail1] = k;
                    Q2[++tail2] = k;
                    while ((mx[Q2[head2]] - mn[Q1[head1]] > m) && (head1 <= tail1 || head2 <= tail2)) {
                        last = min(Q1[head1], Q2[head2]) + 1;
                        while (head1 <= tail1 && Q1[head1] < last)head1++;
                        while (head2 <= tail2 && Q2[head2] < last) head2++;
                    }
                    ans = max(ans, (j - i + 1) * (k - last + 1));
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}