21天好习惯第一期－18 【每日一题】codeJan与旅行

codeJan与旅行
给定n个城市坐标，每个城市可以多次到达，但是只有离开再回来才算次数+1，问一共到m次，最短花费。给出起始位置，并且起始位置不在城市上。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+1;
template
inline void read(T &res) {
char c; T flag = 1;
while ((c = getchar()) < ‘0’ || c > ‘9’)
if (c == ‘-’)
flag = -1;
res = c - ‘0’;
while ((c = getchar()) >= ‘0’ && c <= ‘9’)
res = res * 10 + c - ‘0’;
res = flag;
}
ll pos[N],n,m,p,x,t;
int main() {
read(t);
while(t–) {
x=0;
read(n),read(m),read§;
for(int i=1;i<=n;++i){
read(pos[i]);
if(p>pos[i]){
x=i;
}
}
ll ans=0x3f3f3f3f3f3f3f3f;
for(int i=1;i<n;++i){//i-i+1徘徊
if(i<=x){
if(x-i+1>m){//i~x
continue;
}
ll sx=m-(x-i+1),dis=p-pos[i];
ans=min(ans,dis+sx(pos[i+1]-pos[i]));
if(sx&&x+1<=n){
ans=min(ans,(pos[x+1]-p)2+dis+(sx-1)(pos[i+1]-pos[i]));
}//特判先p->x+1->p
}else{
if(i-x>m){//x+1~i
continue;
}
ll sy=m-(i-x),dis=pos[i]-p;
ans=min(ans,dis+sy*(pos[i+1]-pos[i]));
if(sy&&x>=1){
ans=min(ans,(p-pos[x])2+dis+(sy-1)(pos[i+1]-pos[i]));
}//特判先p->x->p
}
}
printf("%lld\n",ans);
}
return 0;
}