第十五届浙江大学宁波理工学院程序设计大赛 E. Build Pylons(思维)

#include <bits/stdc++.h>
#define maxn 1005
#define ll long long
using namespace std;
int pos[maxn];
int T,n,m;
 
int main()
{
    scanf("%d",&T);
    while(T--){
        map<int,int> ma;
        scanf("%d%d",&n,&m);
        int Min = 10005, Max = 0;
        for(int i=0;i<n;i++){
            int xx;
            scanf("%d",&xx);
            ma[xx] = 1;
            Min = min(Min, xx);
            Max = max(Max, xx);
        }
        ll ans1 = 0, ans2 = 0;
        int p = 0;
        for(int i=Min;i<=Max;i++,p++){
            if(ma[i] == 1) p = 0;
            ans1 += 2 * p + 1;
        }
        ans1 += m;
        for(int i=Max;i>=Min;i--,p++){
            if(ma[i] == 1) p = 0;
            ans2 += 2 * p + 1;
        }
        ans2 += m;
        printf("%lld\n",min(ans1, ans2) - 1);
    }
    return 0;
}