Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream fin("ff.in");
- ofstream fout("ff.out");
- int n,t[101],p[101], N[101];
- void citire()
- {
- fin>>n;
- for(int i=1;i<=n;i++)
- fin>>t[i], p[t[i]]=1;
- }
- void frunze()
- {
- for(int i=1;i<=n;i++)
- {
- if(!p[i]) fout<<i<<" ";
- }
- fout<<endl;
- }
- void dfs(int x,int &k)
- {
- k++;
- for(int i=1;i<=n;i++)
- if(t[x]==i)
- dfs(i,k);
- }
- int main()
- {
- citire();
- frunze();
- int kmax=0;
- for(int i=1;i<=n;i++)
- {
- int k=0;
- if(p[i]==0) dfs(i,k), N[i]=k;
- if(k>kmax) kmax=k;
- }
- for(int i=1;i<=n;i++)
- if(N[i]==kmax) fout<<i<<" ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement