sicily 7973. Hot Dogs in Manhattan

先BFS记录，然后从大到小枚举点，维护最大的曼哈顿距离，具体做法就是维护x+y x-y的最大值和最小值 四个数

新加入的点与之前点的最大值就是MAX（x1+y1）-（x-y）的最大值，x-y同理

#include <iostream>

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
struct node{
int x;
int y;
int dis;
node(int x = 0,int y = 0,int dis = 0){
this->x = x;
this->y = y;
this->dis = dis;
}
};
bool cmp(node a,node b){
return a.dis>b.dis;
}
int w,h;
int num;
node data[1001001];
int a[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
bool visit[1001][1001];
struct edge{
int min;
int max;
};
int MAX(int a,int b){
return a<b?b:a;
}
int MIN(int a,int b){
return a<b?a:b;
}
int ABS(int a){
return a>=0?a:-a;
}
int main(){
int t;
scanf("%d",&t);
while(t--){
int n;
num = 0;
queue<node>  qe;
int x,y;
node p;
memset(visit,false,sizeof(visit));
scanf("%d%d%d",&n,&w,&h);
for(int i = 0;i<n;i++){
scanf("%d%d",&y,&x);
qe.push(node(x,y,0));
visit[x][y] = 1;
}
num = w*h-n-1;
if(n==0){
printf("%d\n",w+h-2);
continue;
}

while(!qe.empty()){
p = qe.front();
qe.pop();
for(int i = 0;i<4;i++){
x = p.x+a[i][0];
y = p.y+a[i][1];
if(x>=0 && x<h && y>=0 && y<w && !visit[x][y]){
visit[x][y] = 1;
node tmp(x,y,p.dis+1);
qe.push(tmp);
data[num--] = tmp;
}
}
}
num = w*h-n;
///sort(data,data+num,cmp);
edge jia,jian;
jia.max = jia.min = data[0].x+data[0].y;
jian.max = jian.min = data[0].x-data[0].y;
for(int i = 1;i<num;i++){
int M = -1;
int sum = data[i].x+data[i].y;
int minu = data[i].x-data[i].y;
M = MAX(M,ABS(sum-jia.min));
M = MAX(M,ABS(sum-jia.max));
jia.max = MAX(jia.max,sum);
jia.min =MIN(jia.min,sum);


M = MAX(M,ABS(jian.max-minu));
M = MAX(M,ABS(jian.min-minu));


jian.max = MAX(jian.max,minu);
jian.min = MIN(jian.min,minu);
if(M>=data[i].dis){
printf("%d\n",data[i].dis);
break;
}
}
}
return 0;
}