Pagini recente » Cod sursa (job #597127) | Cod sursa (job #2510996) | 2050 | Cod sursa (job #347919) | Cod sursa (job #442478)
Cod sursa(job #442478)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
#define foreach(v) for(typeof (v).begin() it=(v).begin();it!=(v).end();it++)
vector <int> G[100005];
int K,viz[100005],M,N,B;
void dfs(int nod,int &alfa)
{ viz[nod]=1;
alfa++;
foreach(G[nod])
if(viz[*it]==0)
{dfs(*it,alfa);
}
}
int main()
{int i,x,y,alfa;
ifstream fin("dfs.in");
fin>>N>>M;
for(i=1;i<=M;i++)
{fin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
fin.close();
for(i=1;i<=N;i++)
if(viz[i]==0)
{alfa=0;
dfs(i,alfa);
K++;
if(alfa>B)
B=alfa;}
ofstream fout("dfs.out");
fout<<K<<'\n'; //punctul b)
fout.close();
return 0;
}