Codeforces Round #481 (Div. 3) 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 [a1,a2,,an][a1,a2,…,an] is called an arithmetic progression if for each ii (1i<n1≤i<n) the value ai+1aiai+1−ai is the same. For example, the sequences [42][42][5,5,5][5,5,5][2,11,20,29][2,11,20,29] and [3,2,1,0][3,2,1,0] are arithmetic progressions, but [1,0,1][1,0,1][1,3,9][1,3,9] and [2,3,1][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 [b1,b2,,bn][b1,b2,…,bn]. 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 11, an element can be increased by 11, an element can be left unchanged.

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

It is possible that the resulting sequence contains element equals 00.

Input

The first line contains a single integer nn (1n100000)(1≤n≤100000) — the number of elements in bb.

The second line contains a sequence b1,b2,,bnb1,b2,…,bn (1bi109)(1≤bi≤109).

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 11, decrease the second number on 11, increase the third number on 11, and the fourth number should left unchanged. So, after Polycarp changed three elements by one, his sequence became equals to [25,20,15,10][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][0,3,6,9,12]

, which is an arithmetic progression

题意:给你一个数列,对每个元素可以+1,-1,不变,求出能让其变为等差数列的最小改变次数.,不存在输出-1

题解:枚举第一个和第二个元素,确定d,然后遍历就行了,输出最小的次数,不存在输出-1;

注意:九种情况的初始化

代码:

#include <iostream>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <stdlib.h>
using namespace std;
const int M = 1e5 + 10;
int a[M];
int an[M];
int n;
int mina = 1 << 30;
struct
{
	int b1, b2, p;
}b[10];

void init()
{
	for (int i = 0; i<3; i++)
	{
		b[i].b1 = 1;
		b[i].p++;
		if (i == 0)
		{
			b[i].b2 = b[i + 3].b2 = b[i + 6].b2 = 1;
			b[i].p++, b[i + 3].p++, b[i + 6].p++;
		}
		if (i == 1)
		{
			b[i].b2 = b[i + 3].b2 = b[i + 6].b2 = 0;
		}
		if (i == 2)
		{
			b[i].b2 = b[i + 3].b2 = b[i + 6].b2 = -1;
			b[i].p++, b[i + 3].p++, b[i + 6].p++;
		}
		b[i + 3].b1 = 0;
		b[i + 6].b1 = -1;
		b[i + 6].p++;
	}
}
int main()
{
	init();
	/*for (int i = 0; i<9; i++)
	{
		cout << b[i].b1 << " " << b[i].b2 << " " << b[i].p << endl;
	}*/
	int ans = 1;
	scanf("%d", &n);
	for (int i = 0; i<n; i++)
	{
		scanf("%d", an + i);
	}
	int p;
	for (int i = 0; i<9; i++)
	{
		for (int j = 0; j < n; j++)
		{
			a[j] = an[j];
		}
		int v = a[0] + b[i].b1 - (a[1] + b[i].b2);
		p = b[i].p;
		a[1] = a[1] + b[i].b2;
		//cout<<v<<" "<<b[i].p<<endl;
		for (int j = 2; j<n; j++)
		{
			//int t = a[j];
			ans = 1;
			if (a[j - 1] - v - a[j] == 1)
			{
				a[j] = a[j] + 1;
				p++;
			}
			else if (a[j - 1] - v - a[j] == -1)
			{
				p++;
				a[j]--;
			}
			else if (a[j - 1] - v - a[j] == 0)
				continue;
			else
			{
				ans = 0;
				break;
			}
		}
		//a[1] = a[1] - b[i].b2;
		if (ans)
			mina = min(mina, p);
	}
	if (mina == 1 << 30)
		printf("-1\n");
	else
		printf("%d\n", mina);
	//system("pause");
}

阅读更多
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

Codeforces Round #481 (Div. 3) D. Almost Arithmetic Progression

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭