Pagini recente » Cod sursa (job #668350) | Cod sursa (job #2616180) | Cod sursa (job #2820681) | Cod sursa (job #59717) | Cod sursa (job #1343435)
#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#define DMAX 100005
using namespace std;
ifstream in("darb.in");
ofstream out("darb.out");
vector <int> G[DMAX];
bitset <DMAX> viz;
int maxd, nodd,n;
void READ()
{
int i,x,y;
in>>n;
for(i=1;i<=n;i++)
{
in>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
}
void DFS(int nod, int niv)
{
unsigned i;
viz[nod]=1;
for(i=0 ; i<G[nod].size(); i++)
{
int vecin=G[nod][i];
if(viz[vecin]==0)
DFS(vecin,niv+1);
}
if(niv>maxd)
{
maxd=niv; nodd=nod;
}
}
int main()
{
READ();
DFS(1,0);
maxd=0;
viz.reset();
DFS(nodd,0);
out<<maxd+1;
return 0;
}