hdu 4007 Dave（线性探查+枚举）

Problem Description

Recently, Dave is boring, so he often walks around. He finds that some places are too crowded, for example, the ground. He couldn't help to think of the disasters happening recently. Crowded place is not safe. He knows there are N (1<=N<=1000) people on the ground. Now he wants to know how many people will be in a square with the length of R (1<=R<=1000000000). (Including boundary).

 

Input

The input contains several cases. For each case there are two positive integers N and R, and then N lines follow. Each gives the (x, y) (<=x, y<=) coordinates of people. 

Output

Output the largest number of people in a square with the length of R.

 

Sample Input

 

Sample Output

Hint

If two people stand in one place, they are embracing.

 

Source

The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest

题目意思：

给你N个点和一个边长为R的正方形，为你用这个正方形最多可以覆盖几个点(在正方形边界上的点也算)。

 

注意：正方形的边一定平行于坐标轴。

 

思路：

对N个点的y坐标进行排序，然后O(N)枚举正方形的下边界。取出N个点中y坐标在上下边界范围内的点。然后O(N)复杂度求出长度为R的边最多可以覆盖的点。所以整体枚举的复杂度为O(N^2)。

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<queue>
 #include<cmath>
 #include<stdlib.h>
 #include<map>
 using namespace std;
 #define inf 1<<30
 #define N 1006
 int n,r;
 struct Node{
     int x,y;
 }p[N];
 int yy[N];
 int xx[N];
 int main()
 {
     while(scanf("%d%d",&n,&r)==){
         for(int i=;i<n;i++){
             scanf("%d%d",&p[i].x,&p[i].y);
             yy[i]=p[i].y;
         }
         sort(yy,yy+n);

         int ans=;
         for(int i=;i<n;i++){
             //int y=yy[i];
             int xcnt=;
             for(int j=;j<n;j++){
                 if(p[j].y<=yy[i]+r && p[j].y>=yy[i]){
                     xx[xcnt++]=p[j].x;
                 }
             }
             sort(xx,xx+xcnt);

             int e=;
             //xx[xcnt++]=inf;
             for(int j=;j<xcnt;j++){
                 while(xx[e]-xx[j]<=r && e<xcnt) e++;
                 ans=max(ans,e-j);
             }

         }
         printf("%d\n",ans);

     }
     return ;
 }