CodeForces - 433C （思维），中位数性质

Ryouko is an extremely forgetful girl, she could even forget something that has just happened. So in order to remember, she takes a notebook with her, called Ryouko's Memory Note. She writes what she sees and what she hears on the notebook, and the notebook became her memory.

Though Ryouko is forgetful, she is also born with superb analyzing abilities. However, analyzing depends greatly on gathered information, in other words, memory. So she has to shuffle through her notebook whenever she needs to analyze, which is tough work.

Ryouko's notebook consists of n pages, numbered from 1 to n. To make life (and this problem) easier, we consider that to turn from page xto page y, |x - y| pages should be turned. During analyzing, Ryouko needs m pieces of information, the i-th piece of information is on page ai. Information must be read from the notebook in order, so the total number of pages that Ryouko needs to turn is .

Ryouko wants to decrease the number of pages that need to be turned. In order to achieve this, she can merge two pages of her notebook. If Ryouko merges page x to page y, she would copy all the information on page x to y (1 ≤ x, y ≤ n), and consequently, all elements in sequence a that was x would become y. Note that x can be equal to y, in which case no changes take place.

Please tell Ryouko the minimum number of pages that she needs to turn. Note she can apply the described operation at most once before the reading. Note that the answer can exceed 32-bit integers.

Input

The first line of input contains two integers n and m (1 ≤ n, m ≤ 105).

The next line contains m integers separated by spaces: a1, a2, ..., am(1 ≤ ai ≤ n).

Output

Print a single integer — the minimum number of pages Ryouko needs to turn.

Examples

Input

4 6
1 2 3 4 3 2

Output

3

Input

10 5
9 4 3 8 8

Output

6

Note

In the first sample, the optimal solution is to merge page 4 to 3, after merging sequence a becomes {1, 2, 3, 3, 3, 2}, so the number of pages Ryouko needs to turn is |1 - 2| + |2 - 3| + |3 - 3| + |3 - 3| + |3 - 2| = 3.

In the second sample, optimal solution is achieved by merging page 9 to 4.

题目给你一个数组，可以改变一个数字（把数组中所有这个数都改成一个数字）。

求操作后，相邻数之间差的绝对值之和最小值。

 

思路，首先要知道有序数组中，中位数到各数的距离之和最小。

数字是1-n，暴力扫一遍要改变的数，然后把这个数组中所有与这个数相邻的数存到另一个数组中（因为不定长，所以这里用vector来储存）。排个序后，这个数与相邻数之差的绝对值和就相当于：求这个数到vector中存的数距离和最小，当然是把它变成中位数后值最小。。。。

 

代码解析：先开二维vector，存i数相邻数的集合。先求不改变时的和。然后暴力扫一遍要改变的数，1-n。把他改成存的相邻数集合的中位数（先进行排序），求改变后的值，求出差值后加上之前的和。  每次求的结果存最小值即可。。

 

#include<cstdio>
#include<vector>
#include<iostream>
#include<algorithm>
#define maxn 100000+100
using namespace std;
vector<int>ber[maxn];
typedef long long ll;
ll a[maxn];
int main()
{
    ll n,m,sum=0;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
        cin>>a[i];
    for(int i=2;i<=m;i++)
    {
        sum+=abs(a[i]-a[i-1]);
        if(a[i]!=a[i-1])
        {
            ber[a[i]].push_back(a[i-1]);
            ber[a[i-1]].push_back(a[i]);
        }
    }
    ll mi=sum;
    for(int i=1;i<=n;i++)
    {
        if(ber[i].size()==0)
            continue;
        sort(ber[i].begin(),ber[i].end());
        int mid=ber[i][ber[i].size()/2];
        ll ans=sum;
        for(int j=0;j<ber[i].size();j++)
        {
            ans+=abs(ber[i][j]-mid)-abs(ber[i][j]-i);
        }
        mi=min(mi,ans);
    }
    cout<<mi<<endl;
    return 0;
}