[luoguP3203][HNOI2010]BOUNCE 弹飞绵羊（LCT）

传送门

每个点都会跳到另一个点，连边就是一棵树。

更改弹力就是换边。

求一个点跳多少次跳到终点就是求这个点的深度，那么只需要维护 size 域，access(n + 1) 然后 splay(x)，求 size[son[x][0]] 即可，

因为 splay 是以深度为关键字的，所以左端点就是深度比它小的。

——代码

 #include <cstdio>
 #include <iostream>
 #define N 200010
 #define min(x, y) ((x) < (y) ? (x) : (y))
 #define max(x, y) ((x) > (y) ? (x) : (y))
 #define swap(x, y) ((x) ^= (y) ^= (x) ^= (y))
 #define get(x) (son[f[x]][1] == (x))
 #define isroot(x) (son[f[x]][0] ^ (x) && son[f[x]][1] ^ (x))

 int n, k;
 int a[N], f[N], size[N], rev[N], son[N][], s[N];

 inline int read()
 {
     int x = , f = ;
     char ch = getchar();
     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;
     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';
     return x * f;
 }

 inline void update(int x)
 {
     if(x)
     {
         size[x] = ;
         if(son[x][]) size[x] += size[son[x][]];
         if(son[x][]) size[x] += size[son[x][]];
     }
 }

 inline void pushdown(int x)
 {
     if(x && rev[x])
     {
         swap(son[x][], son[x][]);
         if(son[x][]) rev[son[x][]] ^= ;
         if(son[x][]) rev[son[x][]] ^= ;
         rev[x] = ;
     }
 }

 inline void rotate(int x)
 {
     int old = f[x], oldf = f[old], wh = get(x);

     if(!isroot(old))
         son[oldf][old == son[oldf][]] = x;
     f[x] = oldf;

     son[old][wh] = son[x][wh ^ ];
     f[son[old][wh]] = old;

     son[x][wh ^ ] = old;
     f[old] = x;

     update(old);
     update(x);
 }

 inline void splay(int x)
 {
     int i, fa, t = ;
     s[++t] = x;
     for(i = x; !isroot(i); i = f[i]) s[++t] = f[i];
     for(i = t; i >= ; i--) pushdown(s[i]);
     for(; !isroot(x); rotate(x))
         if(!isroot(fa = f[x]))
             rotate(get(x) ^ get(fa) ? x : fa);
 }

 inline void access(int x)
 {
     for(int t = ; x; t = x, x = f[x]) splay(x), son[x][] = t, update(x);
 }

 inline void reverse(int x)
 {
     access(x);
     splay(x);
     rev[x] ^= ;
 }

 inline void cut(int x, int y)
 {
     reverse(x);
     access(y);
     splay(y);
     son[y][] = f[x] = ;
     update(y);
 }

 inline void link(int x, int y)
 {
     reverse(x);
     f[x] = y;
     access(x);
 }

 inline int query(int x)
 {
     reverse(n + );
     access(x);
     splay(x);
     return size[son[x][]];
 }

 int main()
 {
     int i, x, y, z;
     n = read();
     for(i = ; i <= n; i++)
     {
         x = read();
         a[i] = f[i] = min(i + x, n + );
         size[i] = ;
     }
     size[n + ] = ;
     k = read();
     for(i = ; i <= k; i++)
     {
         z = read();
         x = read() + ;
         if(z == ) printf("%d\n", query(x));
         else
         {
             y = read();
             cut(x, a[x]);
             link(x, a[x] = min(x + y, n + ));
         }
     }
     return ;
 }