bzoj 2002 弹飞绵羊

某天，Lostmonkey发明了一种超级弹力装置，为了在他的绵羊朋友面前显摆，他邀请小绵羊一起玩个游戏。游戏一开始，Lostmonkey在地上沿着一条直线摆上n个装置，每个装置设定初始弹力系数ki，当绵羊达到第i个装置时，它会往后弹ki步，达到第i+ki个装置，若不存在第i+ki个装置，则绵羊被弹飞。绵羊想知道当它从第i个装置起步时，被弹几次后会被弹飞。为了使得游戏更有趣，Lostmonkey可以修改某个弹力装置的弹力系数，任何时候弹力系数均为正整数。

题解

我来自成都第七分块学校

每个点记录跳出分块的步数以及跳到下一分块的哪个点

#include<cstdio>
#include<cmath>

#define N 200001

int n, block, cnt;
int k[N], belong[N], step[N], next[N];
int l[145], r[145];

int query(int pos) {
	int tmp = 0;
	while (pos) {
		tmp += step[pos];
		pos = next[pos];
	}
	return tmp;
}

int main() {
	scanf("%d", &n); block = (int)sqrt(n);
	cnt = n / block + (n % block ? 1 : 0);
	for (int i = 1; i <= n; i++)
		scanf("%d", &k[i]);
	
	for (int i = 1; i <= cnt; i++)
		l[i] = (i - 1) * block + 1, r[i] = i * block;
	r[cnt] = n;
	for (int i = 1; i <= n; i++)
		belong[i] = (i - 1) / block + 1;

	for (int i = n; i > 0; i--)
		if (i + k[i] > n) step[i] = 1;
		else if (belong[i] == belong[i + k[i]]) {
			step[i] = step[i + k[i]] + 1;
			next[i] = next[i + k[i]];
		}
		else {
			step[i] = 1;
			next[i] = i + k[i];
		}

	int m; scanf("%d", &m);
	while (m--) {
		int op;
		int pos, val;
		scanf("%d%d", &op, &pos);
		pos++;
		if (op == 1) printf("%d\n", query(pos));
		else {
			scanf("%d", &val);
			k[pos] = val;
			for(int i = pos; i >= l[belong[pos]]; i--)
				if (belong[i] == belong[i + k[i]]) {
					step[i] = step[i + k[i]] + 1;
					next[i] = next[i + k[i]];
				}
				else {
					step[i] = 1;
					next[i] = i + k[i];
				}
		}
	}
	return 0;
}