水题
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include <set>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define N 105
int down[N][N],ver[N];
int mat[N][N];
int main ()
{
int n,w,h,s,t;
while(scanf("%d",&n)!=EOF && n)
{
scanf("%d%d",&w,&h);
memset(down,0,sizeof(down));
memset(ver,0,sizeof(ver));
memset(mat,0,sizeof(mat));
int u,v;
for(int i=1;i<=n;++i)
{
scanf("%d%d",&u,&v);
mat[u][v]=1;
}
scanf("%d%d",&s,&t);
for(int j=1;j<=h-t+1;++j)
{
if(j==1)
{
for(int i=1;i<=w;++i)
{
down[i][j]=0;
for(int k=1;k<=t;++k)
if(mat[i][k])
down[i][j]++;
}
continue;
}
for(int i=1;i<=w;++i)
down[i][j]=down[i][j-1]+mat[i][j+t-1]-mat[i][j-1];
}
for(int j=1;j<=h;++j)
{
for(int i=1;i<=s;++i)
ver[j]+=mat[i][j];
}
int ans=0;
for(int i=1;i<=s;++i)
ans+=down[i][1];
int now=ans-ver[t];
for(int j=1;j<=h-t+1;++j)
{
now+=ver[j+t-1]-ver[j-1];
ans=max(ans,now);
int st=now;
for(int i=2;i<=w-s+1;++i)
{
st+=down[i+s-1][j]-down[i-1][j];
ans=max(ans,st);
}
}
printf("%d\n",ans);
}
return 0;
}