bzoj3170&&jzoj3256 【TJOI2013】松鼠聚会 切比雪夫距离

是个概念题。
题目中的距离其实就是切比雪夫距离，把横坐标变为x-y，纵坐标变为x+y以后直接用前缀后缀和统计一下就好了。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e5+5;
int n,m;
typedef long long ll;
ll x[N],y[N],ans=1ll<<62;
ll sumx[N],sumy[N],xx[N],yy[N];
int main()
{
    scanf("%d",&n);
    fo(i,1,n)
    {
        scanf("%lld%lld",&xx[i],&yy[i]);
        x[i]=xx[i]+yy[i];
        y[i]=xx[i]-yy[i];
        xx[i]=x[i],yy[i]=y[i];
    }
    sort(x+1,x+1+n);
    sort(y+1,y+1+n);
    fo(i,1,n)
    {
        sumx[i]=sumx[i-1]+x[i];
        sumy[i]=sumy[i-1]+y[i];
        //printf("%lld %lld\n",sumx[i],sumy[i]);
    }
    fo(i,1,n)
    {
        ll ans1=0,pos=0;
        pos=lower_bound(x+1,x+n+1,xx[i])-x;
        ans1+=(xx[i]*pos-sumx[pos])+((sumx[n]-sumx[pos])-xx[i]*(n-pos));
        pos=lower_bound(y+1,y+n+1,yy[i])-y;
        ans1+=(yy[i]*pos-sumy[pos])+((sumy[n]-sumy[pos])-yy[i]*(n-pos));
    //  printf("%lld\n",ans1);
        ans=min(ans,ans1);
    }
    cout<<ans/2<<endl;
}