[USACO5.3]巨大的牛棚Big Barn【二维前缀和】

题目链接

---

  在一张N*N的图上找一个最大的正方形K*K，使得这个K最大。

  于是我们可以用二维前缀和加上二分答案来确定这个答案。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define eps 1e-8
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(x, y) make_pair(x, y)
#define Min_3(a, b, c) min(a, min(b, c))
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e3 + 7;
int N, T, s[maxN][maxN] = {0};
int sum(int x, int y, int d) { return s[x][y] + s[x - d][y - d] - s[x - d][y] - s[x][y - d]; }
int main()
{
    scanf("%d%d", &N, &T);
    for(int i=1, x, y; i<=T; i++)
    {
        scanf("%d%d", &x, &y);
        s[x][y] = 1;
    }
    for(int i=1; i<=N; i++)
    {
        for(int j=1; j<=N; j++)
        {
            s[i][j] = s[i][j] + s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
        }
    }
    int ans = 0, l, r, mid;
    for(int i=1; i<=N; i++)
    {
        for(int j=1; j<=N; j++)
        {
            l = 1; r = min(i, j);
            while(l <= r)
            {
                mid = HalF;
                if(!sum(i, j, mid))
                {
                    ans = max(ans, mid);
                    l = mid + 1;
                }
                else r = mid - 1;
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}