HDU 5326（并查集小心得）

Work
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1722 Accepted Submission(s): 1037

Problem Description

It’s an interesting experience to move from ICPC to work, end my college life and start a brand new journey in company.
As is known to all, every stuff in a company has a title, everyone except the boss has a direct leader, and all the relationship forms a tree. If A’s title is higher than B(A is the direct or indirect leader of B), we call it A manages B.
Now, give you the relation of a company, can you calculate how many people manage k people.

Input
There are multiple test cases.
Each test case begins with two integers n and k, n indicates the number of stuff of the company.
Each of the following n-1 lines has two integers A and B, means A is the direct leader of B.

1 <= n <= 100 , 0 <= k < n
1 <= A, B <= n

Output
For each test case, output the answer as described above.

Sample Input
7 2
1 2
1 3
2 4
2 5
3 6
3 7

Sample Output
2

题解：运用一半的并查集，要理解并查集的意思，并查集的 find 函数（我一般用的）只是把一个点的祖先节点找出来，并不会把这个节点的父节点改变成祖先节点，一般需要用 join 函数才会改变某个节点。

#include <stdio.h>
#include <string.h>
#include <math.h>
#define M 100010

struct node
{
    int lead, root;
};
node no[M];
bool ok[M];
int n, pre[M], k, peo[M];
double d;
int find(int a)
{
    int r = a;
    while(r != pre[r]) //不改变，只是寻找
    {
        r = pre[r];
        peo[r]++;//过一次就加一次
    }
    return r;
}
void init()
{
    for(int i=1; i<=n; i++)
    {
        pre[i] = i;
        peo[i] = 0;
    }
}

int main()
{
    while(scanf("%d%d", &n, &k) != EOF)
    {
        init();//更新
        int a, b;
        for(int i=1; i<n; i++)
        {
            scanf("%d%d", &a, &b);
            pre[b] = a;//父亲节点直接标注
        }
        for(int i=1; i<=n; i++)
        {
            find(i);
        }
        int sum = 0;
        for(int i=1; i<=n; i++)
        {
            if(peo[i] == k)
            {
                sum++;
            }
        }

        printf("%d\n", sum);
    }

    return 0;
}