Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #define N 101
- using namespace std;
- int n,m,a[N][N],nrc=1,suc[N],pred[N];
- void citire()
- {
- int x,y;
- cin>>n>>m;
- for(int i=1;i<=m;++i)
- cin>>x>>y,a[x][y]=1;
- }
- void dfsuc(int nod)
- {
- suc[nod]=nrc;
- for(int k=1;k<=n;++k)
- if(a[nod][k]==1&&suc[k]==0)
- dfsuc(k);
- }
- void dfpred(int nod)
- {
- pred[nod]=nrc;
- for(int k=1;k<=n;++k)
- if(a[k][nod]==1&&pred[k]==0)
- dfpred(k);
- }
- int main()
- {
- citire();
- nrc=1;
- for(int i=1;i<=n;++i)
- if(suc[i]==0)
- {
- dfsuc(i),dfpred(i);
- for(int j=1;j<=n;j++)
- if(suc[j]!=pred[j])
- suc[j]=pred[j]=0;
- ++nrc;
- }
- int mk=0,k; /// mk = numarul maxim de varfuri pe care le are ocomponenta tare conexa
- for(int i=1;i<nrc;++i)
- {
- k=0; /// k = numara varfurile din componenta i
- for(int j=1;j<=n;j++)
- if(suc[j]==i)
- ++k;
- if(k>mk)
- mk=k;
- }
- for(int i=1;i<nrc;++i)
- {
- k=0; /// k = numara varfurile din componenta i
- for(int j=1;j<=n;++j)
- if(suc[j]==i)
- ++k;
- if(k==mk) /// Daca numarul de varfuri e maxim
- {
- for(int j=1;j<=n;++j) /// afisam componenta respectiva
- if(suc[j]==i)
- cout<<j<<' ';
- cout<<'\n';
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement