Almost Arithmetic Progression CodeForces - 978D（暴力）

参考：https://blog.csdn.net/unclejokerly/article/details/80410223

D. Almost Arithmetic Progression

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp likes arithmetic progressions. A sequence $[a_1,a_2,\dots ,a_n]$ is called an arithmetic progression if for each $i$ ($1\le i<n$) the value $a_{i+1}-a_i$ is the same. For example, the sequences $\left[42\right]$, $[5,5,5]$, $[2,11,20,29]$ and $[3,2,1,0]$ are arithmetic progressions, but $[1,0,1]$, $[1,3,9]$ and $[2,3,1]$ are not.

It follows from the definition that any sequence of length one or two is an arithmetic progression.

Polycarp found some sequence of positive integers $[b_1,b_2,\dots ,b_n]$. He agrees to change each element by at most one. In the other words, for each element there are exactly three options: an element can be decreased by $1$, an element can be increased by $1$, an element can be left unchanged.

Determine a minimum possible number of elements in $b$ which can be changed (by exactly one), so that the sequence $b$ becomes an arithmetic progression, or report that it is impossible.

It is possible that the resulting sequence contains element equals $0$.

Input

The first line contains a single integer $n$ $(1\le n\le 100000)$ — the number of elements in $b$.

The second line contains a sequence $b_1,b_2,\dots ,b_n$ $(1\le b_i\le {10}^9)$.

Output

If it is impossible to make an arithmetic progression with described operations, print -1. In the other case, print non-negative integer — the minimum number of elements to change to make the given sequence becomes an arithmetic progression. The only allowed operation is to add/to subtract one from an element (can't use operation twice to the same position).

Examples

input

Copy

4
24 21 14 10

output

Copy

3

input

Copy

2
500 500

output

Copy

0

input

Copy

3
14 5 1

output

Copy

-1

input

Copy

5
1 3 6 9 12

output

Copy

1

Note

In the first example Polycarp should increase the first number on $1$, decrease the second number on $1$, increase the third number on $1$, and the fourth number should left unchanged. So, after Polycarp changed three elements by one, his sequence became equals to $[25,20,15,10]$, which is an arithmetic progression.

In the second example Polycarp should not change anything, because his sequence is an arithmetic progression.

In the third example it is impossible to make an arithmetic progression.

In the fourth example Polycarp should change only the first element, he should decrease it on one. After that his sequence will looks like $[0,3,6,9,12]$

, which is an arithmetic progression

题意：给出长为n的数列，你可以对每一个数进行+1，-1操作，也可以不进行操作，问，最少需要几次操作才能使这个数列变成等差数列。如果不能变为等差数列，则输出-1.

思路：直接暴力即可，应为只要确定了前两个数的差，就可以确定后面所有的数了，所以，直接枚举前两个数的差，然后检查后面的数是否符合要求，复杂度O（9×n）

#include "iostream"
#include "cmath"
using namespace std;
const int Max=1e6+10;
int a[Max],b[Max];
int main()
{
    ios::sync_with_stdio(false);
    int n,flag;
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    int ans,Min=0xfffffff;
    for(int i=-1;i<=1;i++){//3*3种情况
        for(int j=-1;j<=1;j++) {
            ans=abs(i)+abs(j);
            flag=1;
            b[1]=a[1]+i;
            b[2]=a[2]+j;
            int d=b[2]-b[1];
            for(int k=3;k<=n;k++){//检查剩下的数
                if(abs((b[k-1]+d)-a[k])<=1){
                    b[k]=b[k-1]+d;
                    ans+=abs(b[k]-a[k]);
                }
                else{
                    flag=0;
                    break;
                }
            }
            if(flag){
                if(ans<Min) Min=ans;
            }
        }
    }
    if(Min<0xfffffff) cout<<Min<<endl;
    else cout<<"-1"<<endl;
}