CF305C.Ivan and Powers of Two

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Ivan has got an array of $n$ non-negative integers $a_{1},a_{2},...,a_{n}$ . Ivan knows that the array is sorted in the non-decreasing order.

Ivan wrote out integers $2^{a_{1}},2^{a_{2}},...,2^{a_{n}}$ on a piece of paper. Now he wonders, what minimum number of integers of form $2^{b}$ $(b>=0)$ need to be added to the piece of paper so that the sum of all integers written on the paper equalled $2^{v}-1$ for some integer $v$ $(v>=0)$ .

Help Ivan, find the required quantity of numbers.

输入格式

The first line contains integer $n$ ( $1<=n<=10^{5}$ ). The second input line contains $n$ space-separated integers $a_{1},a_{2},...,a_{n}$ $(0<=a_{i}<=2·10^{9})$ . It is guaranteed that $a_{1}<=a_{2}<=...<=a_{n}$ .

输出格式

Print a single integer — the answer to the problem.

输入输出样例

输入#1
```
4
0 1 1 1
```
输出#1
```
0
```
输入#2
```
1
3
```
输出#2
```
3
```

说明/提示

In the first sample you do not need to add anything, the sum of numbers already equals $2^{3}-1=7$ .

In the second sample you need to add numbers $2^{0},2^{1},2^{2}$ .

首页