Pagini recente » Cod sursa (job #1831825) | Cod sursa (job #1008621) | Cod sursa (job #757373) | Cod sursa (job #2444707) | Cod sursa (job #2196651)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("darb.in");
ofstream fout("darb.out");
long long int a[9999][9999],c[100002],viz[100002],k,n;
void citire()
{
fin>>n;
int x,y;
while(fin>>x>>y)
a[x][y]=a[y][x]=1;
}
int bf(int x)
{
int p,u,i;
for(i=1;i<=n;++i)
viz[i]=0;
p=u=1;
c[p]=x;
viz[x]=1;
while(p<=u)
{
x=c[p++];
for(i=1;i<=n;++i)
if(!viz[i]&&a[x][i])
{
viz[i]=viz[x]+1;
c[++u]=i;
}
}
k=viz[c[u]];
return c[u];
}
int main()
{
citire();
bf(bf(1));
fout<<k;
return 0;
}