[BZOJ2002][Hnoi2010]Bounce弹飞绵羊 LCT

题目链接：http://www.lydsy.com/JudgeOnline/problem.php?id=2002

建图，每次往后面跳就往目标位置连边，将跳出界的点设为同一个点。对于修改操作发现可以用LCT维护图的连通性，然后用size域维护跳的点的次数就行了。

 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;
 int inline readint(){
     int Num;char ch;
     while((ch=getchar())<''||ch>'');Num=ch-'';
     while((ch=getchar())>=''&&ch<='') Num=Num*+ch-'';
     return Num;
 }
 void outint(int x){
     if(x>=) outint(x/);
     putchar(x%+'');
 }
 int n,fa[],ch[][],siz[];
 bool inline Isroot(int &x){
     return ch[fa[x]][]!=x&&ch[fa[x]][]!=x;
 }
 void inline Pushup(int &x){
     siz[x]=siz[ch[x][]]+siz[ch[x][]]+;
 }
 void Rot(int x,int p){
     int y=fa[x],z=fa[y];
     fa[ch[x][!p]]=y;ch[y][p]=ch[x][!p];
     fa[x]=z;if(!Isroot(y)) ch[z][ch[z][]==y]=x;
     fa[y]=x;ch[x][!p]=y;
     Pushup(y);Pushup(x);
 }
 void Splay(int x){
     while(!Isroot(x)){
         if(Isroot(fa[x])) Rot(x,ch[fa[x]][]==x);
         else{
             int y=fa[x],z=fa[y],p=ch[z][]==y;
             if(ch[y][p]==x) Rot(y,p),Rot(x,p);
             else Rot(x,!p),Rot(x,p);
         }
     }
 }
 void Access(int x){
     for(int t=;x;x=fa[x]){
         Splay(x);
         ch[x][]=t;
         Pushup(x);
         t=x;
     }
 }
 void Link(int x,int y){
     Access(x);Splay(x);
     fa[ch[x][]]=;
     ch[x][]=;
     fa[x]=y;
     Pushup(x);
 }
 void Qry(int x){
     Access(x);Splay(x);
     outint(siz[x]);
     putchar('\n');
 }
 int main(){
     n=readint();
     for(int i=;i<=n;i++){
         int x=readint()+i;
         fa[i]=x>n?:x;
     }
     int m=readint();
     for(int i=;i<=m;i++){
         int opt=readint();
         if(opt==){
             int a=readint();
             Qry(a+);
         }
         else{
             int a=readint(),
                 b=readint();
             Link(a+,(a+b+)>n?:(a+b+));
         }
     }
     return ;
 }