R - Sonya and Hotels

Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.

The country where Sonya lives is an endless line. There is a city in each integer coordinate on this line. She has nn hotels, where the ii-th hotel is located in the city with coordinate xixi. Sonya is a smart girl, so she does not open two or more hotels in the same city.

Sonya understands that her business needs to be expanded by opening new hotels, so she decides to build one more. She wants to make the minimum distance from this hotel to all others to be equal to dd. The girl understands that there are many possible locations to construct such a hotel. Thus she wants to know the number of possible coordinates of the cities where she can build a new hotel.

Because Sonya is lounging in a jacuzzi in one of her hotels, she is asking you to find the number of cities where she can build a new hotel so that the minimum distance from the original nn hotels to the new one is equal to d.

Input

The first line contains two integers nn and dd (1≤n≤1001≤n≤100, 1≤d≤1091≤d≤109) — the number of Sonya's hotels and the needed minimum distance from a new hotel to all others.

The second line contains nn different integers in strictly increasing order x1,x2,…,xn (−109≤xi≤109) — coordinates of Sonya's hotels.

Output

Print the number of cities where Sonya can build a new hotel so that the minimum distance from this hotel to all others is equal to d.

Sample 1

Inputcopy	Outputcopy
4 3 -3 2 9 16	6

Sample 2

Inputcopy	Outputcopy
5 2 4 8 11 18 19	5

Note

In the first example, there are 66 possible cities where Sonya can build a hotel. These cities have coordinates −6, 5, 6, 12, 13, and 19.

In the second example, there are 55 possible cities where Sonya can build a hotel. These cities have coordinates 2, 6, 13, 16, and 21.

题意翻译

一根数轴上已经有了 n 家酒店, 且坐标已知. 现在想要新建一家酒店, 要求这家酒店与其他所有酒店的距离的最小值等于 d , 问有多少种方案?

输入:

第一行有两个整数 n 和 d (1 <= n <= 100, 1 <= d <= 1e9), 分别表示酒店的数目和新酒店到其他所有酒店的距离的最小值.

第二行有严格递增的 n 个整数 x1, x2, ..., xn (-1e9 <= xi <= 1e9), 分别表示现有酒店的坐标.

输出:

方案数量

#include<iostream>
#include<algorithm>

using namespace std;
const int N = 110;
int n, d;
int a[N], b[N];

int main()
{
	cin >> n >> d;
	int sum = 0;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n-1; i++) b[i] = a[i+1] - a[i];  //计算相邻元素之间的差
	for (int i = 1; i <= n; i++)
	{
		if (b[i] > 2 * d) sum += 2;  //如果相邻元素之间的差大于2*d，则可以建两家酒店
		if (b[i] == 2 * d) sum++;  //等于则可以建一家酒店，小于就无法建酒店
	}

	cout << sum+2 << endl;  //最后输出的时候考虑两个端点，左端点的左侧，右端点的右侧各可以建一家酒店
}