Pagini recente » Cod sursa (job #396547) | Cod sursa (job #2446110) | Cod sursa (job #2460845) | Cod sursa (job #2074483) | Cod sursa (job #2037368)
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("darb.in");
ofstream fout("darb.out");
int n,i,x,y,u,nr,Max;
vector <int> l[100010];
bool viz[100010];
void dfs(int nod,int nr)
{
viz[nod]=1;
for(int i=0; i<l[nod].size() ; i++)
{
if(viz[l[nod][i]]==0)
dfs(l[nod][i],nr+1);
}
if(nr>Max)
{
Max=nr;
u=nod;
}
}
int main()
{
fin>>n;
for(i=1;i<n;i++)
{
fin>>x>>y;
l[x].push_back(y);
l[y].push_back(x);
}
dfs(1,1);
memset(viz,0,n+1);
nr=0;
dfs(u,1);
fout<<Max;
return 0;
}