Pagini recente » Cod sursa (job #2782399) | Cod sursa (job #2531193) | Cod sursa (job #621576) | Cod sursa (job #2129567) | Cod sursa (job #2326323)
#include <bits/stdc++.h>
#define NMAX 100001
using namespace std;
ifstream fin("darb.in");
ofstream fout("darb.out");
vector <int> a[NMAX];
bool viz[NMAX];
int capat,vmax;
int lungime=0;
void DFS(int x,int lg)
{
viz[x]=1;
for(int i=0; i<a[x].size(); i++)
{
int vecin = a[x][i];
if(viz[vecin]==0) DFS(vecin,lg+1);
}
if(lg>vmax)
{
vmax=lg; capat=x;
}
}
int main()
{
int n;
fin >> n;
int x,y;
for(int i=1; i<=n; i++)
{
fin >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}
DFS(1,1);
for(int i=1; i<=n; i++) viz[i]=0;
vmax=-1;
DFS(capat,1);
fout << vmax;
return 0;
}