跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2572. Roadside Trees (Simplified Edition)

  • ID: 2578
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 贪心
  • 模拟
  • 算法思想
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Roadside Trees (Simplified Edition)

题目描述

B. Roadside Trees (Simplified Edition)
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Squirrel Liss loves nuts. There are n trees (numbered 1 to n from west to east) along a street and there is a delicious nut on the top of each tree. The height of the tree i is hi. Liss wants to eat all nuts.

Now Liss is on the root of the tree with the number 1. In one second Liss can perform one of the following actions:

  • Walk up or down one unit on a tree.
  • Eat a nut on the top of the current tree.
  • Jump to the next tree. In this action the height of Liss doesn't change. More formally, when Liss is at height h of the tree i (1≤i≤n-1), she jumps to height h of the tree i+1. This action can't be performed if h>hi+1.

Compute the minimal time (in seconds) required to eat all nuts.

Input

The first line contains an integer n (1≤n≤105) − the number of trees.

Next n lines contains the height of trees: i-th line contains an integer hi (1≤hi≤104) − the height of the tree with the number i.

Output

Print a single integer − the minimal time required to eat all nuts in seconds.

Examples
Input
2
1
2
Output
5
Input
5
2
1
2
1
1
Output
14

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2220 题。保留原作者与原赛事署名。