D. Almost Arithmetic Progression

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.

题意：给你一个数组a，你被允许将每个元素加一、减一或者不变，问把这个数组变成等差数列需要的最少的操作次数，

如果无法操作就输入-1.

题解：对于等差数列我们只需要确定第一项和公差。这个等差数列就被确定了，所以可以只考虑该数组前两项能组合出来的情况

：一共9种。然后再遍历数组验证答案即可，复杂度：O（9*n）

#include<iostream>
#include<stdio.h>
#include<queue>
#include<string>
#include<string.h>
#include<cmath>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define LL long long int
LL a[100005], b[100005];
int main()
{
	int n;
	ios::sync_with_stdio(false);
	while (cin >> n) {
		for (int i = 1;i <= n;i++) {
			cin >> a[i];
		}
		int ans = INF;
		for (int i = -1;i <= 1;i++) {
			for (int j = -1;j <= 1;j++) {
				int flag = 1, cnt = abs(i) + abs(j);
				b[1] = a[1] + i;
				b[2] = a[2] + j;
				int tmp = b[2]-b[1];
				for (int k = 3;k <= n;k++) {
					b[k] = b[k - 1] + tmp;
					if (abs(b[k] - a[k]) > 1) { flag = 0;break; }
					if (b[k] != a[k])cnt++;
				}
				if (flag)ans = min(ans, cnt);
			}
		}
		if (ans != INF) {
			cout << ans << endl;
		}
		else {
			cout << "-1" << endl;
		}
	}

	return 0;
}
//好气啊