cf 8VC Venture Cup 2017 C

题目描述：
C. PolandBall and Forest
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
PolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs with k vertices and k - 1 edges, where k is some integer. Note that one vertex is a valid tree.

There is exactly one relative living in each vertex of each tree, they have unique ids from 1 to n. For each Ball i we know the id of its most distant relative living on the same tree. If there are several such vertices, we only know the value of the one with smallest id among those.

How many trees are there in the forest?

Input
The first line contains single integer n (1 ≤ n ≤ 104) — the number of Balls living in the forest.

The second line contains a sequence p1, p2, …, pn of length n, where (1 ≤ pi ≤ n) holds and pi denotes the most distant from Ball i relative living on the same tree. If there are several most distant relatives living on the same tree, pi is the id of one with the smallest id.

It’s guaranteed that the sequence p corresponds to some valid forest.

Hacking: To hack someone, you should provide a correct forest as a test. The sequence p will be calculated according to the forest and given to the solution you try to hack as input. Use the following format:

In the first line, output the integer n (1 ≤ n ≤ 104) — the number of Balls and the integer m (0 ≤ m < n) — the total number of edges in the forest. Then m lines should follow. The i-th of them should contain two integers ai and bi and represent an edge between vertices in which relatives ai and bi live. For example, the first sample is written as follows:

5 3
1 2
3 4
4 5
Output
You should output the number of trees in the forest where PolandBall lives.

Interaction
From the technical side, this problem is interactive. However, it should not affect you (except hacking) since there is no interaction.

Examples
input
5
2 1 5 3 3
output
2
input
1
1
output
1
Note
In the first sample testcase, possible forest is: 1-2 3-4-5.

There are 2 trees overall.

In the second sample testcase, the only possible graph is one vertex and no edges. Therefore, there is only one tree.

大值题意：

有n个结点。
距离第i个结点最远的结点是pi。
问有多少颗树。

思路分析：

并查集。
i和pi必在一棵树上。
建好树，最后看有多少个根节点就好了~

ac代码：

#include <iostream>
#include<stdio.h>
using namespace std;
const int MAX = 30000;
int n,m,k;
int parent[MAX+10];
int GetParent(int a)
{
     if( parent[a]!= a)
        parent[a] = GetParent(parent[a]);
     return parent[a];
}
void Merge(int a,int b)
{
    int p1 = GetParent(a);
    int p2 = GetParent(b);
    if( p1 == p2 )
        return;
    parent[p2] = p1;
}
int main()
{
    int T;
    scanf("%d",&n);
    for(int i = 0;i <= n; ++i)
    {
        parent[i] = i;
    }
    int work=0;
    for(int i = 1;i <=n; ++i)
    {
        int h;
        scanf("%d",&h);
        if(GetParent(h)!=GetParent(i))
            Merge(i,h);
    }
    int num=0;
    for(int i=1;i<=n;i++)
    {
        if(GetParent(i)==i)
            num++;
    }
    cout<<num<<endl;
    return 0;
}