#include<iostream> #include<algorithm> using namespace std;
int n; int width,height; int result; int mmax; struct Position { int x,y; }pos[501]; int s,t;
void input() { cin>>width>>height; for(int i = 1;i <= n;i++) { cin>>pos[i].x >> pos[i].y; } cin>>s>>t; }
bool check(int x,int y) { return ((x <= width) && (y <= height)); }
void panduan(int w,int h) { for(int i = 1;i <= n;i++) { if(((pos[i].x >= w) &&(pos[i].x <= (w+s -1)))&& ((pos[i].y >= h)&& (pos[i].y <= (h+t-1)))) { result++; } } } void solve() { for(int i = 1;i <= width;i++) { for(int j = 1;j <= height;j++) { if(check(i+s-1,j+t-1)) { panduan(i,j); if(mmax < result) { mmax = result; } result = 0; } } }
}
int main() { while(cin>>n && n != 0) { input(); // sort(pos+1,pos+n+1,cmp);
result = 0; mmax = 0; solve(); cout<<mmax<<endl;
} return 0; }
poj2029
最新推荐文章于 2021-04-30 13:27:21 发布