dp专题 CodeForces - 407B

题目
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).
题目大意
有n+1个房间,对于第i个房间,均2条通道,第一条为pi,第二条为i+1(通往房间i+1),小V每次从第一个房间开始,求小V走到第n+1个房间要经过多少条通道。小V每进入一个房间都先在墙壁上画一个十字架（开始时小V在第一个房间画了一个十字架）,如果十字架的个数为奇数,那么小V走第一条通道,如果十字架个数为偶数,那么小V走第二条通道。
解题思路
由于p[i]<=i,那么要到达第i+1个房间,必须要从第i个房间的第二条通道走过。所以当小V到达第i个房间时,前面i-1个房间的十字架个数均为偶数。
设g[i]表示小V在第i个房间通过第一条通道（十字架个数为奇数）,再走回第i个房间所要通过的通道数(包括从第i个房间走到第p[i]个房间这条通道)。
则g[i]=1+g[p[i]]+g[p[i]+1]+g[p[i]+2]+…+g[i-1]+(i-p[i])
(i-p[i]为第k(p[i]<=k<=i-1)个房间到达第k+1个房间的通道数)
设f[i]表示小V从第一个房间到达第i个房间且房间墙壁上十字架个数为偶数所需要通过的通道数,则f[i]=f[i-1]+1+g[i]
s[i]表示g[i]数组的前缀和（由于数据范围小,直接用for循环计算g[i]也可以）
注意取模。。。
代码

#include <cstdio>
#include <iostream>
#define MOD 1000000007
using namespace std;
long long f[1010],g[1010],s[1010];
int p[1010];
int main()
{
	int n;
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	  scanf("%d",&p[i]);
	f[1]=1;//走到第i个房间且十字架的个数为偶数所需要的次数 
	g[1]=1;//g[i]表示在第i个房间,进入p[i]房间再走回第i个房间所需要的次数 
	s[1]=1;//g[i]的前缀和 
	for (int i=2;i<=n;i++)
	  {
	  	long long x=(s[i-1]-s[p[i]-1]+MOD)%MOD;
	  	g[i]=(x+1+(i-p[i]))%MOD;
	  	f[i]=(g[i]+f[i-1]+1)%MOD;
	  	s[i]=(s[i-1]+g[i])%MOD;
	  }
	long long ans=(f[n]+1)%MOD;  
	cout<<ans<<endl;    
	
}