Codeforces 797E Array Queries

题目

describe
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.

题意：

手动模拟一遍很容易看懂

题解：

纯暴力会TLE 用dp处理k较小的情况，k>300暴力求解 i 表示 p 值，j 表示 k 值 dp[i][j] 经过 M 次变换得到
则dp[i+a[i]+j][j] 经过 M-1 次变换得到 然后，初值不会赋，卡了好久，发现……倒着做就好了

AC代码：

#include<stdio.h>

const int maxn=1e5+1;
int dp[maxn][300];
int n,q,p,k,a[maxn];

void predp()
{
    for (int i=n;i>0;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;
    return;
}

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

不要当k<300时都dp 会TLE（我觉得除了我应该没人这么幼稚）