题目链接:
题意:
给了n个点,现在给一个起点,问最少访问n-1个点的最小行走距离是多少;
思路:
分情况讨论就好了;
AC代码:
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <bits/stdc++.h> #include <stack> #include <map> using namespace std; #define For(i,j,n) for(int i=j;i<=n;i++) #define mst(ss,b) memset(ss,b,sizeof(ss)); typedef long long LL; template<class T> void read(T&num) { char CH; bool F=false; for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar()); for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar()); F && (num=-num); } int stk[70], tp; template<class T> inline void print(T p) { if(!p) { puts("0"); return; } while(p) stk[++ tp] = p%10, p/=10; while(tp) putchar(stk[tp--] + '0'); putchar(' '); } const LL mod=1e9+7; const double PI=acos(-1.0); const int inf=1e9; const int N=1e5+10; const int maxn=1e3+20; const double eps=1e-12; int n,m; int a[N]; int main() { read(n);read(m); For(i,1,n)read(a[i]); sort(a+1,a+n+1); if(n==1)cout<<"0"; else { int ans=inf; if(m>=a[n])ans=m-a[2]; else if(m<=a[1])ans=a[n-1]-m; else { ans=min(ans,abs(m-a[1])+a[n-1]-a[1]); ans=min(ans,abs(m-a[2])+a[n]-a[2]); ans=min(ans,abs(a[n]-m)+a[n]-a[2]); ans=min(ans,abs(a[n-1]-m)+a[n-1]-a[1]); } cout<<ans<<endl; } return 0; }