POJ 1988 Cube Stacking

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

并查集 + 细节处理

#include <iostream>
#include <cstdio>
#include <cstring>
#define Maxn 100005
using namespace std;
int pre[Maxn],deep[Maxn],sum[Maxn];

int Find(int x) {
    if(pre[x] == x) return x;
    else {
        int r = pre[x];
        pre[x] = Find(pre[x]);
        deep[x] += deep[r];
    }
    return pre[x];
}

void Merge(int a,int b) {
    int fa = Find(a), fb = Find(b);
    if(fa != fb) {
        pre[fa] = fb;
        deep[fa] = sum[fb];
        sum[fb] += sum[fa];
    }
}

int main(int argc,char* argv[]) {
    int n,a,b; scanf("%d",&n);
    char ch;
    for(int i=1; i<=n; i++)
        pre[i] = i,deep[i] = 0,sum[i] = 1;
    for(int i=1; i<=n; i++) {
        cin >> ch;
        if(ch == 'M') {
            scanf("%d %d",&a,&b);
            if(Find(a) != Find(b)) Merge(a,b);
        }
        else if(ch == 'C') {
            scanf("%d",&a);
            Find(a);
            printf("%d\n",deep[a]);
        }
    }

    return 0;
}