单调栈求所有全1矩形的个数

 模板

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 3001;
const int maxm = 3001;
int a[maxn][maxm],h[maxn][maxm];
int st[maxn];
int cnt[maxn][maxn];
int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    for( int i = 1;i <= n;i++ ){
        for( int j = 1;j <= m;j++ ){
            scanf("%d",&a[i][j]);
        }
    }
    for( int i = 1;i <= m;i++ ){
        for( int j = 1;j <= n;j++ ){
            if( a[j][i]==0 ) h[j][i] = 0;
            else h[j][i] = h[j-1][i] + 1;
        }
    }
    LL ans = 0;
    for( int i = 1;i <= n;i++ ){
        int top = 0;
        for( int j = 1;j <= m;j++ ){
            while( top && h[i][j] < h[i][ st[top] ] )top--;
            st[++top] = j;
            if( top > 1 )cnt[i][j] += cnt[i][ st[top-1] ];
            cnt[i][j] += 1LL * (j - st[top-1])* h[i][j];
            ans += cnt[i][j];
        }
    }
    printf("%lld\n",ans);
    return 0;
}