Pagini recente » Cod sursa (job #1086937) | Cod sursa (job #3200580) | Cod sursa (job #1924196) | Cod sursa (job #2065766) | Cod sursa (job #1858124)
#include <fstream>
using namespace std;
ifstream f("darb.in");
ofstream g("darb.out");
int N, x[100001],nodpornire,lmax;
bool A[10000][100000], viz[100000];
void df(int i, int l)
{
if(l>lmax)
{
lmax=l;
nodpornire=i;
}
viz[i]=1;
int j;
for(j=1;j<=N;j++)
if(A[i][j] && viz[j]==0)
df(j,l+1);
}
int main()
{
int i,x,y;
f>>N;
for(i=1;i<= N-1;i++ )
{
f>>x>>y;
A[x][y]=1;
A[y][x]=1;
}
df(1,1);
x=nodpornire;
//lmax=0;
for(i=1;i<=N;i++)
viz[i]=0;
df(nodpornire,1);
g<<lmax;
return 0;
f.close();
g.close();
return 0;
}