CF407B Long Path

题面：

B. Long Path

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 numberpi, 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 pidenotes 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 test(s)

input

2
1 2

output

4

input

4
1 1 2 3

output

20

input

5
1 1 1 1 1

output

62

————————————————————————————————————————————————————————

思想就是DP

二维状态num[N][2]

0状态表示它不跳转到Pi点中引起的数据变化，

1状态表示跳转的变化。

所以就可以得出对应的状态转移方程了。

————————————————————————————————————————————————————————

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <math.h>
#include <time.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int N = 1005;
const int M = 1005;
const LL MOD = 1000000007;
int ans = 0;
int n;
LL num[N][2];
int p[N];
int main() {

    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
       scanf("%d", &p[i]);
    }
    for (int i = 1; i <= n; i++) {
        num[i][0] = (num[i-1][0] + num[i-1][1]+1)%MOD;
        for (int j = p[i]; j < i; j++) {
            num[i][1] ++;
            num[i][1] += num[j][1];
            num[i][1] %= MOD;
        }
        num[i][1]++;
    }
    cout<<(num[n][0] + num[n][1])%MOD<<endl;
    return 0;
}