POJ - 2029 Get Many Persimmon Trees(暴力水题)

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;

int n, w, h, s, t;
int map

;

void init() {
scanf("%d%d", &w, &h);
memset(map, 0, sizeof(map));

int x, y;
for (int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
map[x][y] = 1;
}
scanf("%d%d", &s, &t);
}

void solve() {
int ans = 0;

for (int i = 1; i + s - 1 <= w; i++)
for (int j = 1; j + t - 1 <= h; j++) {
int cnt = 0;
for (int k = i; k < i + s; k++)
for (int l = j; l < j + t; l++)
if (map[k][l]) cnt++;
ans = max(cnt, ans);
}
printf("%d\n", ans);
}

int main() {
while (scanf("%d", &n) != EOF && n) {
init();
solve();
}
return 0;
}