Codeforces 408D Long Path

D. 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).

题意是给N个房间，每个房间两道门，第奇数次到这个房间只能走第一个门即返回以前的，偶数次到这个房间走第二个门到达下一个房间，第一次做的时候傻傻的一步一步做，毫无疑问的T了，赛后才发现是有规律的,DP题目，还在取模上WA了两发。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
	int n;
	int p[1010];
	__int64 dp[1010];//dp[i]是到达这个房间走到下一个房间的步数。 
	__int64 sum=0;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&p[i]);
	}
	dp[1]=2;//从第一个房间到第二个房间是两步 
	for(int i=2;i<=n;i++)
	{
		dp[i]=2;//从一个房间到下一个房间是两步+返回这个房间需要的步数 
		int s=p[i];
		while(s<i)
		{
			dp[i]+=dp[s];
			s++;
			dp[i]%=1000000007;//多次取模 
		}
		dp[i]%=1000000007;//多次取模 
	}
	for(int i=1;i<=n;i++)
	{
		sum+=dp[i];
		sum%=1000000007;//多次取模 
	}
	cout<<sum%1000000007<<endl;//多次取模 
}