poj 2029 Get Many Persimmon Trees 暴力枚举

//poj 2029
//sep9
#include<iostream>
using namespace std;
int map[128][128];
int main()
{
	int i,j,n,w,h,s,t;
	while(scanf("%d",&n)==1&&n){
		memset(map,0,sizeof(map));
		scanf("%d%d",&w,&h);
		while(n--){
			scanf("%d%d",&i,&j);
			map[i][j]=1;
		} 
		scanf("%d%d",&s,&t);
		for(i=1;i<=w;++i)
			for(j=1;j<=h;++j)
				map[i][j]+=map[i-1][j]+map[i][j-1]-map[i-1][j-1];
		int ans=0;
		for(i=s;i<=w;++i)
			for(j=t;j<=h;++j)
				ans=max(ans,map[i][j]-map[i-s][j]-map[i][j-t]+map[i-s][j-t]);
		printf("%d\n",ans);
	}
	return 0;	
}