Educational Codeforces Round 19 E. Array Queries【DP预处理】 水

E. Array Queries

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

Copy

3
1 1 1
3
1 1
2 1
3 1

output

Copy

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.

思路：

假如k=1，那么至多循环1e5次。随着k的变大，循环次数越来越少。如果k到300，循环次数仅有30~40次

那么dp预处理出 dp[p][k]其中p∈[1,n],k∈[1,300] 

状态转移方程方程为dp[p][k]= p+a[p]+k>n?:1:dp[p+a[p]+k][k]+1;

#include<bits/stdc++.h>
#define PI acos(-1.0)
#define pb push_back
using namespace std;
typedef long long ll;

const int N=1e5+5;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;

int a[N],dp[100001][301],n,q,p,k;

void init(){
    for(int i=n;i>=1;--i){
        for(int j=1;j<=300;j++){
            if(i+a[i]+j>n)  dp[i][j]=1;
            else    dp[i][j]=dp[i+a[i]+j][j]+1;
        }
    }
}

int main(void){
    cin >>n;
    for(int i=1;i<=n;i++)   scanf("%d",&a[i]);
    init();
    cin >> q;
    while(q--){
        scanf("%d%d",&p,&k);
        if(k<=300) printf("%d\n",dp[p][k]);
        else{
            int ans=0;
            while(p<=n)  ans++,p=p+a[p]+k;
            printf("%d\n",ans);
        }
    }


    return 0;
}

/*********

*********/