dp:房间

Description
One day, little Vasya found himself in a maze consisting of (n + 1) rooms, numbered from 1 to (n + 1). Initially, Vasya is at the first room and to get out of the maze, he needs to get to the (n + 1)-th one.

The maze is organized as follows. Each room of the maze has two one-way portals. Let’s consider room number i(1 ≤ i ≤ n), someone can use the first portal to move from it to room number (i + 1), also someone can use the second portal to move from it to room number pi, where 1 ≤ pi ≤ i.

In order not to get lost, Vasya decided to act as follows.

Each time Vasya enters some room, he paints a cross on its ceiling. Initially, Vasya paints a cross at the ceiling of room 1.
Let’s assume that Vasya is in room i and has already painted a cross on its ceiling. Then, if the ceiling now contains an odd number of crosses, Vasya uses the second portal (it leads to room pi), otherwise Vasya uses the first portal.
Help Vasya determine the number of times he needs to use portals to get to room (n + 1) in the end.

Input
The first line contains integer n (1 ≤ n ≤ 103) — the number of rooms. The second line contains n integers pi (1 ≤ pi ≤ i). Each pi denotes the number of the room, that someone can reach, if he will use the second portal in the i-th room.

Output
Print a single number — the number of portal moves the boy needs to go out of the maze. As the number can be rather large, print it modulo 1000000007(109 + 7).

Sample Input
Input
2
1 2
Output
4
Input
4
1 1 2 3
Output
20
Input
5
1 1 1 1 1
Output
62

1，要想往前走只有通过第一种途径（此时标记的个数为偶数），也就是说出了你第一次走到当前位置，其他位置的标记个数都是偶数；
2，记走到第i个位置步数为dp[i]，必定是通过i-1走过来的，第一次走到i位置将会往回走，直到第二次走到此位置时才会往前走那么dp[i]=dp[i-1]+1+（再次从往回走后的那个位置走到第i个位置）+1；
3，第二次到达回溯位置时和第一次到达回溯位置时各位置均为偶数，两次状态相同，那么步数也是相同的，那么上式括号处的步数应当为dp[i]-dp[num[i]];

综上dp[i]=dp[i-1]*2-dp[num[i-1]]+2；

#include<iostream>
#include<cstdio>
using namespace std;
int num[10000];
long long dp[10000];
const int mod=1e9+7;
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    scanf("%d",&num[i]);
    for(int i=1;i<=n;i++)
    dp[i+1]=((2*dp[i])%mod-dp[num[i]]+2+mod)%mod;//要注意可能再取模的时候会出现负数
        cout<<dp[n+1]<<endl;
    return 0;
}