#include #define fi first #define se second #define eb emplace_back #define mp make_pair using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef __int128 i128; template T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);} template T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);} template bool chmax(T &a,const S b) {return (a bool chmin(T &a,const S b) {return (a>b?a=b,1:0);} int popcnt(int x) {return __builtin_popcount(x);} int popcnt(ll x) {return __builtin_popcountll(x);} int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));} int topbit(ll x) {return (x==0?-1:63-__builtin_clzll(x));} int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));} int lowbit(ll x) {return (x==0?-1:__builtin_ctzll(x));} #define int long long #define rep(i,a,b) for(int i=(a);i<=(b);i++) #define per(i,a,b) for(int i=(a);i>=(b);i--) typedef pair pii; typedef vector vi; typedef vector vp; int read() { int x=0,w=1; char c=getchar(); while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();} while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} return x*w; } const int N=505,inf=1e9; int e[N][N],n,x[N],y[N],k,d[N]; bool work(int p) { rep(i,0,n+1) rep(j,0,n+1) { int dis=abs(x[i]-x[j])+abs(y[i]-y[j]); e[i][j]=max(1ll,(dis+p-1)/p)-1; } static bool vst[N]; rep(i,0,n+2) vst[i]=0; rep(i,0,n+2) d[i]=inf; d[0]=0; rep(i,0,n+1) { int u=n+2; rep(j,0,n+1) if(!vst[j]&&d[j]>1; if(work(mid)) ans=mid, r=mid-1; else l=mid+1; } printf("%lld\n",ans); return 0; }