ZOJ-1716

水题，不多说

#include<stdio.h>
#include<string.h>

int main()
{
    int n, p[100][100], r[100][100];
    while (scanf("%d", &n), n)
    {
        int w, h, s, t, i, j, k, l;
        memset(p, 0, 100 * 100 * sizeof(int));
        memset(r, 0, 100 * 100 * sizeof(int));
        scanf("%d %d", &w, &h);
        for (i = 0; i < n; i++)
        {
            scanf("%d %d", &s, &t);
            p[t][s] = 1;
        }
        scanf("%d %d", &s, &t);
        for (i = 1; i <= h; i++)
            for (j = 1; j <= w; j++)
                if (p[i][j])
                {
                    for (k = i - t + 1; k <= i; k++)
                        for (l = j - s + 1; l <= j; l++)
                            if (k > 0 && l > 0)
                                r[k][l]++;
                }
        int max = -1;
        for (i = 1; i <= h; i++)
            for (j = 1; j <= w; j++)
                if (r[i][j] > max)
                    max = r[i][j];
        printf("%d\n", max);
    }
    return 0;
}