Codeforces 978D. Almost Arithmetic Progression（1ni）

题目地址 点击打开链接

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 或者 不变，问最少改变几位数字，可以使得 这个 这个序列是单调的，递增或递减或不变

思路：一开始还以为是DP！后来想想暴力就可以过了，关键是 首尾的数字，因为假如满足条件的话，是一个单调的序列，假设每个数字之间的差值 dis ，第一位是 a 接下来就是 a+dis , a+2*dis .....

判断下能否达到这个条件就行了。

然后只需要枚举出 首尾的数字就可以了

假设 第一位是 x,最后一位是y

有 

(x+1,y+1),

(x+1,y+0),

(x+1,y+1),

(x,y+1),

(x,y+0),

(x,y+1),

(x-1,y+1),

(x-1,y+0),

(x-1,y+1),

找出最小的改变的数量，没有就输出-1

#include<bits/stdc++.h>
using namespace std;

int a[100005];
int b[100005];
int main()
{
	int n;
	cin >> n;
	for(int i=0;i<n;i++) cin >> a[i];
	
	if(n==1)
	{
		cout << 0 << endl;
		return 0;
	}
	
	
	for(int i=0;i<n;i++) b[i]=a[i];
	int dis = a[n-1]- a[0];
	
	int cc[10];
	for(int i=-2;i<=2;i++)
	{
		cc[i+2] = (dis+i)/(n-1); 
	}
	
	int min1 =1e8;
	
	for(int k=0;k<5;k++)
	{
		for(int j=-1;j<=1;j++)
		{
			int num=0;
			for(int i=0;i<n;i++) a[i]=b[i];
			a[0] = a[0] + j;
			if(j!=0) num++;
			for(int i=1;i<n;i++)
			{
				if( abs(cc[k] - (a[i]-a[i-1])) <=1)
				{
				    if(abs(cc[k] - (a[i]-a[i-1]))==1)num++;
					a[i]=a[0] + cc[k]*i;
				}
				else{
					num=-1;
					break;
				}
			} 
			if(num!=-1)
			{
				min1 = min(min1,num);
			}
		}	
	}
	if(min1==1e8) cout << -1 << endl;
	else cout << min1 << endl;
}