Sonya and Hotels

题意翻译

一根数轴上已经有了 n 家酒店, 且坐标已知. 现在想要新建一家酒店, 要求这家酒店与其他所有酒店的距离的最小值等于 d , 问有多少种方案? 输入: 第一行有两个整数 n 和 d (1 <= n <= 100, 1 <= d <= 1e9), 分别表示酒店的数目和新酒店到其他所有酒店的距离的最小值. 第二行有严格递增的 n 个整数 x1, x2, ..., xn (-1e9 <= xi <= 1e9), 分别表示现有酒店的坐标. 输出: 方案数量

题目描述

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 $ n $ hotels, where the $ i $ -th hotel is located in the city with coordinate $ x_i $ . 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 $ d $ . 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 $ n $ hotels to the new one is equal to $ d $ .

输入输出格式

输入格式

The first line contains two integers $ n $ and $ d $ ( $ 1\leq n\leq 100 $ , $ 1\leq d\leq 10^9 $ ) — the number of Sonya's hotels and the needed minimum distance from a new hotel to all others. The second line contains $ n $ different integers in strictly increasing order $ x_1, x_2, \ldots, x_n $ ( $ -10^9\leq x_i\leq 10^9 $ ) — coordinates of Sonya's hotels.

输出格式

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 $ .

输入输出样例

输入样例 #1

4 3
-3 2 9 16

输出样例 #1

6

输入样例 #2

5 2
4 8 11 18 19

输出样例 #2

5

说明

In the first example, there are $ 6 $ 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 $ 5 $ 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), 分别表示现有酒店的坐标. 输出: 方案数量