BZOJ 2241

2241: [SDOI2011]打地鼠

二维差分

BZOJ 2241

/**************************************************************
    Problem: 2241
    User: Dream_Tonight
    Language: C++
    Result: Accepted
    Time:48 ms
    Memory:1376 kb
****************************************************************/
 
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
 
 
using namespace std;
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 1e5 + 7;
const int inf = 2139062143;
int n, m, s, t, cnt = 0, result = 0;
int mp[105][105], tmp[105][105];
 
void add(int i, int j, int x, int y, int v) {
    tmp[i][j] += v;
    tmp[i][j + y] -= v;
    tmp[i + x][j] -= v;
    tmp[i + x][j + y] += v;
}
 
void check(int x, int y) {
    memset(tmp, 0, sizeof(tmp));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            tmp[i][j] += tmp[i - 1][j] + tmp[i][j - 1] - tmp[i - 1][j - 1];
            if (tmp[i][j] > mp[i][j]) return;
            if (tmp[i][j] < mp[i][j]) {
                if (j + y > m + 1 || i + x > n + 1) return;
                add(i, j, x, y, mp[i][j] - tmp[i][j]);
            }
        }
    }
//    cout << x << y << endl;
    result = max(result, x * y);
}
 
int main() {
#ifndef ONLINE_JUDGE
    freopen("weather.in", "r", stdin);
#endif
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scanf("%d", &mp[i][j]);
            cnt += mp[i][j];
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (cnt % (i * j) == 0) {
                check(i, j);
            }
        }
    }
    printf("%d\n", cnt / result);
    return 0;
}