CodeForces - 364E(二维分治)

给出一个n*m的矩形，问有多少个子矩阵包含1的个数为k

参考博客

好难的一题分治。。基本分治思路是不断切割中线，一刀水平，一刀垂直的切

每次切割完后枚举割线两边的矩形包含的1的个数，例如如下这幅图，是按水平中线分割完的，然后先枚举矩形的左右边界Y1,Y2，接着再枚举矩形的上下边界，按这样分治可以保证每次数的矩形都会穿过切割的中线，可以保证矩形不数重，不数漏

博客里的人每次分治后矩形的左上角是（x1-1, y1-1）而不是（x1,y1），暂时还不知道这样写的用意

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

using namespace std;
typedef __int64 ll;
const int mx = 2505;
int n, m, K, pre[mx][mx], up[10], down[10];
ll ans;
char mat[mx][mx];

int calc(int x1, int y1, int x2, int y2) {
    return pre[x2][y2] - pre[x1][y2] - pre[x2][y1] + pre[x1][y1];
}
void work(int x1, int y1, int x2, int y2, bool flag) {
   if (x1 == x2 || y1 == y2) return ;
   if (x2-x1==1 && y2-y1==1) {
        ans += (calc(x1, y1, x2, y2) == K);
        return ;
   }
   if (flag) {
        int mid = (x1 + x2) / 2;
        work(x1, y1, mid, y2, !flag);
        work(mid, y1, x2, y2, !flag);
        for (int i = y1; i < y2; i++) {
            up[0] = down[0] = mid;
            for (int j = 1; j <= K+1; j++)
                up[j] = x1, down[j] = x2;
            for (int j = i+1; j <= y2; j++) {
                for (int k = 1; k <= K+1; k++) {
                    while (calc(up[k], i, mid, j) >= k) up[k]++;
                }
                for (int k = 1; k <= K+1; k++) {
                    while (calc(mid, i, down[k], j) >= k) down[k]--;
                }
                for (int k = 0; k <= K; k++) {
                    ans += (up[k]-up[k+1]) * (down[K-k+1]-down[K-k]);//相当于mid上部分面积为k,下部分面积为K-k，加起来刚好为K
                }
            }
        }
   }
   else {
        int mid = (y1 + y2) / 2;
        work (x1, y1, x2, mid, !flag);
        work (x1, mid, x2, y2, !flag);
        for (int i = x1; i < x2; i++) {
            up[0] = down[0] = mid;
            for (int j = 1; j <= K+1; j++)
                up[j] = y1, down[j] = y2;
            for (int j = i+1; j <= x2; j++) {
                for (int k = 1; k <= K+1; k++) {
                    while (calc(i, up[k], j, mid) >= k) up[k]++;
                }
                for (int k = 1; k <= K+1; k++) {
                    while (calc(i, mid, j, down[k]) >= k) down[k]--;
                }
                for (int k = 0; k <= K; k++) {
                    ans += (up[k]-up[k+1]) * (down[K-k+1]-down[K-k]);
                }
            }
        }
   }
}

int main() {
    scanf("%d%d%d", &n, &m, &K);
    for (int i = 1; i <= n; i++) {
        scanf("%s", mat[i]+1);
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            pre[i][j] = pre[i-1][j] + pre[i][j-1] - pre[i-1][j-1] + (mat[i][j]-'0');
        }
    }
    ans = 0;
    work(0, 0, n, m, false);
    printf("%I64d\n", ans);
    return 0;
}