Codeforces Round #363 (Div. 2) D. Fix a Tree

1.去环，
2.合并成一棵树。
第二步简单，第一步本题如果有环必然经过根，因此把根指向总树的跟

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<vector>
#include<set>
#define LL long long
#define maxn 200005
using namespace std;
char s[300000];
int fa[maxn];
int am[maxn];
int sym[maxn];
int sum = 0;
vector<int>ve[maxn];
int sum1 = 0,all;
void dfs(int pre,int root)
{
     sym[pre] = 1;
     for(int i=0;i<ve[pre].size();i++)
     {
         if(!sym[ve[pre][i]]) dfs(ve[pre][i],root);
         else if(ve[pre][i]==root){

                 if(all!=-1){fa[root] = all;sum++;}
                 else {fa[root] = root;all = root,sum++;}
         }
     }
}
int main()
{
    int n;
    scanf("%d",&n);
    all = -1;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&fa[i]);
        if(i!=fa[i])ve[fa[i]].push_back(i);
    }
    vector<int>ve2;
    for(int i=1;i<=n;i++)if(fa[i]==i){if(all==-1)all = i;ve2.push_back(i);dfs(i,i);}
    for(int i=1;i<=n;i++)if(!sym[i])dfs(i,i);
    for(int i=0;i<ve2.size();i++) if(ve2[i]!=all){fa[ve2[i]] = all;sum++;}

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

    for(int i=1;i<=n;i++)printf("%d ",fa[i]);
    return 0;
}