MMP??? 居然正方形是水平的…我不知道啊…
先根据 y 坐标从小到大排序,然后对 y 坐标尺取,然后对所在符合区间内的
点,存起来,以 x 坐标从小到大排序,再尺取一下…
复杂度 < N^2LogN;
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e3+10;
struct Node{
int x, y;
}q[N],ok[N];
int n ,r;
bool cmpx(Node a, Node b){
return a.x < b.x;
}
bool cmpy(Node a, Node b){
return a.y < b.y;
}
int main(){
while(~scanf("%d%d", &n, &r)){
for(int i=1;i<=n;i++) scanf("%d%d", &q[i].x, &q[i].y);
sort(q+1, q+n+1, cmpy);
int num, Left, Right;
int ans = 0;
for(int i=1;i<=n;i++){
Left = Right = i;
while(Right < n && q[Right + 1].y - q[Left].y <= r)
Right++;
num = 0;
for(int k=Left;k<=Right;k++)
ok[num++] = q[k];
sort(ok, ok+num, cmpx);
Left = Right = 0;
for(;Left < num && Right < num;Left++){
Right = Left;
while(Right + 1 < num && ok[Right + 1].x - ok[Left].x <= r)
Right++;
ans = max(ans, Right - Left + 1);
}
}
printf("%d\n", ans);
}
return 0;
}