Problem:
Score : 300 points

Problem Statement

There is a circular pond with a perimeter of K meters, and N houses around them.

The i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.

When traveling between these houses, you can only go around the pond.

Find the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.

Constraints

2 \leq K \leq 10^6

2 \leq N \leq 2 \times 10^5

0 \leq A_1 < ... < A_N < K

All values in input are integers.

Input

Input is given from Standard Input in the following format:

K N
A_1 A_2 ... A_N

Output

Print the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.

Sample Input 1

20 3
5 10 15

Sample Output 1

10

If you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.

Sample Input 2

20 3
0 5 15

Sample Output 2

10

If you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
#define pi acos(-1)
#define maxn 100001
using namespace std;
typedef long long ll;
const int mx=200005;
//ll a[mx];
//ll tree[mx*4];
//ll n;
//ll solve(ll arr[], ll x, ll n)
//{
//  ll *low = lower_bound(arr, arr+n, x);
//  if (low == (arr + n) || *low != x)
//     return 0;
//  ll *high = upper_bound(low, arr+n, x);
//  return high - low;
//}
//void init(int node, int b, int e)
//{
//    if (b == e)
//    {
//        tree[node] = a[b];
//        return;
//    }
//    int Left = node * 2;
//    int Right = node * 2 + 1;
//    int mid = (b + e) / 2;
//    init(Left, b, mid);
//    init(Right, mid + 1, e);
//    ll x= max(tree[Left],tree[Right]);
//    tree[node]=solve(a,x,n);
//}
//int query(int node, int b, int e, int i, int j)
//{
//    if (i > e || j < b)
//        return 0;
//    if (b >= i && e <= j)
//        return tree[node];
//    int Left = node * 2;
//    int Right = node * 2 + 1;
//    int mid = (b + e) / 2;
//    int p1 = query(Left, b, mid, i, j);
//    int p2 = query(Right, mid + 1, e, i, j);
//    ll x= max(p1,p2);
//    return solve(a,x,n);
//}
//void update(int node, int b, int e, int i, int newvalue)
//{
//    if (i > e || i < b)
//        return;
//    if (b >= i && e <= i) {
//        tree[node] = newvalue;
//        return;
//    }
//    int Left = node * 2;
//    int Right = node * 2 + 1;
//    int mid = (b + e) / 2;
//    update(Left, b, mid, i, newvalue);
//    update(Right, mid + 1, e, i, newvalue);
//    tree[node] = __gcd(tree[Left] , tree[Right]);
//}
//void euiler()
//{
//    for(int i=1;i<maxn;i++)phi[i]=i;
//    for(int p=2;p<maxn;p++){
//        if(phi[p]==p){
//            phi[p]=p-1;
//            for(int i=2*p;i<maxn;i+=p){
//                phi[i]=(phi[i]/p)*(p-1);
//            }
//        }
//    }
//}
//void update(ll idx,ll val)
//{
//    while(idx<=n){
//        tree[idx]=max(tree[idx],val);
//        idx+=(idx&-idx);
//    }
//}
//ll query(ll idx)
//{
//    ll sum=0;
//    while(idx>0){
//        sum=max(sum,tree[idx]);
//        idx-=(idx&-idx);
//    }
//    return sum;
//}

int main()
{
   ll n,k;
   cin>>n>>k;
   ll a[k+2];
   ll mx=LONG_MIN;
   for(int i=0;i<k;i++){
    cin>>a[i];
   }
   sort(a,a+k);
   if(a[0]==0){
    cout<<a[k-1]-a[1]<<endl;
   }
   else{
    cout<<a[k-1]-a[0]<<endl;
   }
}