Cube Stacking

运用了并查集，并且问到了具体的某个量，那么也就用到来了路径压缩。

Description

Farmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a single cube. Farmer John asks Betsy to perform P (1<= P <= 100,000) operation. There are two types of operations: 
moves and counts. 
* In a move operation, Farmer John asks Bessie to move the stack containing cube X on top of the stack containing cube Y. 
* In a count operation, Farmer John asks Bessie to count the number of cubes on the stack with cube X that are under the cube X and report that value. 

Write a program that can verify the results of the game. 

Input

* Line 1: A single integer, P 

* Lines 2..P+1: Each of these lines describes a legal operation. Line 2 describes the first operation, etc. Each line begins with a 'M' for a move operation or a 'C' for a count operation. For move operations, the line also contains two integers: X and Y.For count operations, the line also contains a single integer: X. 

Note that the value for N does not appear in the input file. No move operation will request a move a stack onto itself. 

Output

Print the output from each of the count operations in the same order as the input file. 

Sample Input

6
M 1 6
C 1
M 2 4
M 2 6
C 3
C 4

Sample Output

1
0
2
<span style="font-size:18px;">#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int max_n=30000;
struct Cube
{
    int p;///父亲结点
    int d;///距离父亲结点的距离
    int rankn;///一共有多少块
}cube[max_n];

void ready()
{
    for(int i=1;i<=max_n;i++)///<=maxn 很重要
    {
        cube[i].p=i;
        cube[i].d=0;
        cube[i].rankn=1;
    }
}

int find_net(int x)
{
    if(x==cube[x].p)
        return x;
    else
    {
        int t=cube[x].p;
        cube[x].p=find_net(cube[x].p);///将所有的点都直接连到根部
        cube[x].d+=cube[t].d;
        return cube[x].p;
    }
}

void union_net(int x,int y)
{
    int fx=find_net(x);
    int fy=find_net(y);
    if(fx==fy) return ;
    cube[fy].p=fx;
    cube[fy].d=cube[fx].rankn;
    cube[fx].rankn+=cube[fy].rankn;
}
int main()
{
    ready();
    int p;
    scanf("%d",&p);
    getchar();
    while(p>0)
    {
        char op;
        scanf("%c",&op);
        if(op=='M')
        {
            int x,y;
            scanf("%d%d",&x,&y);
            union_net(x,y);
        }
        else if(op=='C')
        {
            int x;
            scanf("%d",&x);
            int fx=find_net(x);
            printf("%d\n",cube[fx].rankn-cube[x].d-1);
        }
        getchar();
        p--;
    }
    return 0;
}</span>