1902.马拉松

include[HTML_REMOVED]

include[HTML_REMOVED]

include[HTML_REMOVED]

using namespace std;
const int N=1e5+10;
int n,x[N],y[N];
int main(){
scanf(“%d”,&n);
int cha1,cha2,cha3,cha=0;
long long ans=0;
for(int i=0;i<n;i) scanf(“%d%d”,&x[i],&y[i]);
for(int i=0;i<n-2;i){
cha1=abs(x[i]-x[i+1])+abs(y[i]-y[i+1]);
cha3=abs(x[i]-x[i+2])+abs(y[i]-y[i+2]);
cha2=abs(x[i+1]-x[i+2])+abs(y[i+1]-y[i+2]);
ans+=cha1;
cha=max(cha1+cha2-cha3,cha);
}
printf(“%lld”,ans+cha2-cha);
return 0;
}