BZOJ1529【DFS】

/* I will wait for you */
 
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
 
using namespace std;
 
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
 
const int maxn=2000010;
const int maxm=1010;
const int maxs=26;
const int INF=1<<29;
const int P=1000000007;
const double error=1e-9;
 
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9') f=(ch=='-'?-1:1),ch=getchar();
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
 
struct edge{ int v,next; }e[maxn];
 
int n,cnt,ans,head[maxn],vis[maxn];
 
void add(int u,int v)
{
    e[cnt]=(edge){v,head[u]},head[u]=cnt++;
    e[cnt]=(edge){u,head[v]},head[v]=cnt++;
}
 
void dfs(int u)
{
    vis[u]=1;
    for(int i=head[u],v;i!=-1;i=e[i].next) if(!vis[v=e[i].v]) dfs(v);
}
 
int main()
{
    n=read(),memset(head,-1,sizeof(head));
    for(int i=1,u;i<=n;i++) u=read(),add(i,u);
     
    for(int i=1;i<=n;i++) if(!vis[i]) ans++,dfs(i);
     
    printf("%d\n",ans);
    return 0;
}