|x1−x2|+|y1−y2|=max((x1+y1)+(−x2−y2),(x1−y1)+(−x2+y2),(−x1+y1)+(+x2−y2),(x1−y1)+(+x2+y2))
所以对于四种情况 分别求最大值,
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=1e5+100;
int sta[4][N];
const int inf=2e9+10;
int main(){
#ifdef DouBi
freopen("in.cpp","r",stdin);
#endif // DouBi
int n,m;while(scanf("%d%d",&n,&m)!=EOF){
int c;scanf("%d",&c);
for(int i=0;i<c;i++){
int a,b;scanf("%d%d",&a,&b);
sta[0][i]=b-a;
sta[1][i]=a-b;
sta[2][i]=a+b;
sta[3][i]=-(a+b);
}
sort(sta[0],sta[0]+c);
sort(sta[1],sta[1]+c);
sort(sta[2],sta[2]+c);
sort(sta[3],sta[3]+c);
// for(int i=0;i<c;i++){
// printf("%d %d %d %d\n",sta[0][i],sta[1][i],sta[2][i],sta[3][i]);
// }
int ans=inf,id=-1;
int d;scanf("%d",&d);
for(int i=0;i<d;i++){
int x,y;scanf("%d%d",&x,&y);
int bns=max(x-y+sta[0][c-1],max(y-x+sta[1][c-1],max(-(x+y)+sta[2][c-1],x+y+sta[3][c-1])));
if(id==-1||bns<ans){
ans=bns,id=i;
}
}
printf("%d\n%d\n",ans,id+1);
}
return 0;
}