CodeForces - 284D：（记忆化搜索）

Discription
Farmer John has just given the cows a program to play with! The program contains two integer variables, x and y, and performs the following operations on a sequence a1, a2, …, an of positive integers:

Initially, x = 1 and y = 0. If, after any step, x ≤ 0 or x > n, the program immediately terminates.
The program increases both x and y by a value equal to ax simultaneously.
The program now increases y by ax while decreasing x by ax.
The program executes steps 2 and 3 (first step 2, then step 3) repeatedly until it terminates (it may never terminate). So, the sequence of executed steps may start with: step 2, step 3, step 2, step 3, step 2 and so on.
The cows are not very good at arithmetic though, and they want to see how the program works. Please help them!

You are given the sequence a2, a3, …, an. Suppose for each i (1 ≤ i ≤ n - 1) we run the program on the sequence i, a2, a3, …, an. For each such run output the final value of y if the program terminates or -1 if it does not terminate.

Input
The first line contains a single integer, n (2 ≤ n ≤ 2·105). The next line contains n - 1 space separated integers, a2, a3, …, an (1 ≤ ai ≤ 109).

Output
Output n - 1 lines. On the i-th line, print the requested value when the program is run on the sequence i, a2, a3, …an.

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

Examples
Input
4
2 4 1
Output
3
6
8

Input
3
1 2
Output
-1
-1

Note
In the first sample

For i = 1,  x becomes and y becomes 1 + 2 = 3.
For i = 2,  x becomes and y becomes 2 + 4 = 6.
For i = 3,  x becomes and y becomes 3 + 1 + 4 = 8.

题意
开始给定x=1，y=0，给定一个序列a[],a[]的第一位为i，不断重复进行两个操作。
1.x+a[x]，y+a[x];
2.x-a[x]，y+a[x];
直到x<=0,或者x>n;
输出i从2到n的所有y值。

思路
记忆化搜索一下，具体看代码。

AC代码

#include<bits/stdc++.h>
using namespace std;
int n,ans;
long long a[200010];///a[]序列
long long vis[200010][5]；///标记数组，用来记录某状态是否访问，i为x，j为是加还是减
long long dp[200010][5];///结果。dp[i][j]中i为x的值，j为状态，dp为在当前状态下的y值
void dfs(long long i,long long j)
{
    if(vis[i][j])
        return ;///若执行过程中同一状态被访问两遍，则死循环，直接跳出即可。
    vis[i][j]=1;///标记
    long long x;
    if(j==1)
        x=i-a[i];
    else
        x=i+a[i];///求解x的下一个值
    if(x<=0||x>n)
        dp[i][j]=a[i];///判断截至条件，即操作停止时，给赋值a[i]
    else
    {
        dfs(x,j^1);///继续搜索下一个状态
        if(dp[x][j^1]!=-1)
            dp[i][j]=dp[x][j^1]+a[i];///若当前状态有值，就等于后一状态加当前的a[i]
        else
            return;
    }
}
int main()
{
    scanf("%d",&n);
    memset(dp,-1,sizeof(dp));///赋初值-1
    memset(vis,0,sizeof(vis));
    for(int i=2;i<=n;i++)
        scanf("%lld",&a[i]);
    for(int i=2;i<=n;i++)
        dfs(i,1);///对每一个状态进行搜索，并且存到数组里
    for(int i=2;i<=n;i++)
    {
        if(dp[i][1]!=-1)
        dp[i][1]+=(i-1);
    }///如果x可以正常跳出，则加上a[1]的值
    for(int i=2;i<=n;i++)
        printf("%lld\n",dp[i][1]);
}