Codeforces 797E - Array Queries

E. Array Queries

题目链接：http://codeforces.com/problemset/problem/797/E

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

a is an array of n positive integers, all of which are not greater than n.

You have to process q queries to this array. Each query is represented by two numbers p and k. Several operations are performed in each query; each operation changes p to p + ap + k. There operations are applied until p becomes greater than n. The answer to the query is the number of performed operations.

Input

The first line contains one integer n (1 ≤ n ≤ 100000).

The second line contains n integers — elements of a (1 ≤ ai ≤ n for each i from 1 to n).

The third line containts one integer q (1 ≤ q ≤ 100000).

Then q lines follow. Each line contains the values of p and k for corresponding query (1 ≤ p, k ≤ n).

Output

Print q integers, ith integer must be equal to the answer to ith query.

Example

input

3
1 1 1
3
1 1
2 1
3 1

output

2
1
1

Note

Consider first example:

In first query after first operation p = 3, after second operation p = 5.

In next two queries p is greater than n after the first operation.

题目大意：英文很简单，略。

方法：dp.

状态：dp[j][i]表示对i进行操作，每次加上a[i]+j（同时更新i的值），最后使i>n所需的操作次数。

　　　　 ┏　dp[j][i+a[i]+j]+1 ， i+a[i]+j<=n;

dp[j][i]=┃

　　　　 ┗  1  ,  i+a[i]+j>n.

代码：

#include<iostream>
#include<cstdio>
using namespace std;
const int N=1e5+;
const int S=;//j上界取sqrt(n)，大一点也可以
int a[N];
int dp[S+][N];
int main()
{
    int n;
    cin>>n;
    for(int i=;i<=n;i++)cin>>a[i];
    int q,p,k;
    cin>>q;
    for(int j=;j<=S;j++)
    {
        for(int i=n;i>=;i--)
        {
            if(i+a[i]+j>n)dp[j][i]=;
            else dp[j][i]=dp[j][i+a[i]+j]+;
        }
    }
    for(int i=;i<q;i++)
    {
        cin>>p>>k;
        int cnt=;
        if(k<=S)cout<<dp[k][p]<<endl;
        else
        {
            while(p<=n)
            {
                cnt++;
                p+=a[p]+k;
            }
            cout<<cnt<<endl;
        }
    }
    return ;
}