Update lct.md

diff --git a/docs/ds/lct.md b/docs/ds/lct.md
index 4efd62c..48595c1 100644 (file)
--- a/docs/ds/lct.md
+++ b/docs/ds/lct.md
@@ -581,72 +581,72 @@ LCT 通过 `Split(x,y)` 操作，可以将树上从点 $x$ 到点 $y$ 的路径
     const int maxn=10010;
     struct Splay
     {
-        int ch[maxn][2],fa[maxn],tag[maxn];
-        void clear(int x){ch[x][0]=ch[x][1]=fa[x]=tag[x]=0;}
-        int getch(int x){return ch[fa[x]][1]==x;}
-        int isroot(int x){return ch[fa[x]][0]!=x&&ch[fa[x]][1]!=x;}
-        void pushdown(int x)
-        {
-            if(tag[x])
-            {
-                if(ch[x][0])swap(ch[ch[x][0]][0],ch[ch[x][0]][1]),tag[ch[x][0]]^=1;
-                if(ch[x][1])swap(ch[ch[x][1]][0],ch[ch[x][1]][1]),tag[ch[x][1]]^=1;
-                tag[x]=0;
-            }
-        }
-        void update(int x)
-        {
-            if(!isroot(x))update(fa[x]);
-            pushdown(x);
-        }
-        void rotate(int x)
-        {
-            int y=fa[x],z=fa[y],chx=getch(x),chy=getch(y);
-            fa[x]=z;if(!isroot(y))ch[z][chy]=x;
-            ch[y][chx]=ch[x][chx^1];fa[ch[x][chx^1]]=y;
-            ch[x][chx^1]=y;fa[y]=x;
-        }
-        void splay(int x)
-        {
-            update(x);
-            for(int f=fa[x];f=fa[x],!isroot(x);rotate(x))
-            if(!isroot(f))rotate(getch(x)==getch(f)?f:x);
-        }
-        void access(int x)
-        {
-            for(int f=0;x;f=x,x=fa[x])splay(x),ch[x][1]=f;
-        }
-        void makeroot(int x)
-        {
-            access(x);splay(x);
-            swap(ch[x][0],ch[x][1]);
-            tag[x]^=1;
-        }
-        int find(int x)
-        {
-            access(x);splay(x);
-            while(ch[x][0])x=ch[x][0];
-            splay(x);
-            return x; 
-        }
+       int ch[maxn][2],fa[maxn],tag[maxn];
+       void clear(int x){ch[x][0]=ch[x][1]=fa[x]=tag[x]=0;}
+       int getch(int x){return ch[fa[x]][1]==x;}
+       int isroot(int x){return ch[fa[x]][0]!=x&&ch[fa[x]][1]!=x;}
+       void pushdown(int x)
+       {
+               if(tag[x])
+               {
+                       if(ch[x][0])swap(ch[ch[x][0]][0],ch[ch[x][0]][1]),tag[ch[x][0]]^=1;
+                       if(ch[x][1])swap(ch[ch[x][1]][0],ch[ch[x][1]][1]),tag[ch[x][1]]^=1;
+                       tag[x]=0;
+               }
+       }
+       void update(int x)
+       {
+               if(!isroot(x))update(fa[x]);
+               pushdown(x);
+       }
+       void rotate(int x)
+       {
+               int y=fa[x],z=fa[y],chx=getch(x),chy=getch(y);
+               fa[x]=z;if(!isroot(y))ch[z][chy]=x;
+               ch[y][chx]=ch[x][chx^1];fa[ch[x][chx^1]]=y;
+               ch[x][chx^1]=y;fa[y]=x;
+       }
+       void splay(int x)
+       {
+               update(x);
+               for(int f=fa[x];f=fa[x],!isroot(x);rotate(x))
+               if(!isroot(f))rotate(getch(x)==getch(f)?f:x);
+       }
+       void access(int x)
+       {
+               for(int f=0;x;f=x,x=fa[x])splay(x),ch[x][1]=f;
+       }
+       void makeroot(int x)
+       {
+               access(x);splay(x);
+               swap(ch[x][0],ch[x][1]);
+               tag[x]^=1;
+       }
+       int find(int x)
+       {
+               access(x);splay(x);
+               while(ch[x][0])x=ch[x][0];
+               splay(x);
+               return x; 
+       }
     }st;
     int n,q,x,y;
     char op[maxn];
     int main()
     {
-        scanf("%d%d",&n,&q);
-        while(q--)
-        {
-            scanf("%s%d%d",op,&x,&y);
-            if(op[0]=='Q'){if(st.find(x)==st.find(y))printf("Yes\n");else printf("No\n");}
-            if(op[0]=='C')if(st.find(x)!=st.find(y))st.makeroot(x),st.fa[x]=y;
-            if(op[0]=='D')
-            {
-                st.makeroot(x);st.access(y);st.splay(y);
-                if(st.ch[y][0]==x&&!st.ch[x][1])st.ch[y][0]=st.fa[x]=0; 
-            }
-        }
-        return 0;
+       scanf("%d%d",&n,&q);
+       while(q--)
+       {
+               scanf("%s%d%d",op,&x,&y);
+               if(op[0]=='Q'){if(st.find(x)==st.find(y))printf("Yes\n");else printf("No\n");}
+               if(op[0]=='C')if(st.find(x)!=st.find(y))st.makeroot(x),st.fa[x]=y;
+               if(op[0]=='D')
+               {
+                       st.makeroot(x);st.access(y);st.splay(y);
+                       if(st.ch[y][0]==x&&!st.ch[x][1])st.ch[y][0]=st.fa[x]=0; 
+               }
+       }
+       return 0;
     }
     ```