Pagini recente » Cod sursa (job #2221772) | Cod sursa (job #1760998) | Cod sursa (job #871266) | Cod sursa (job #2194480) | Cod sursa (job #2862128)
#include <iostream>
#include <fstream>
using namespace std;
int jart[100000]={};
int d[100000]={},maxi=0,hely=0;
int n;
int a[100][100];
ifstream f("darb.in");
ofstream g("darb.out");
void szomszedsagi_matrix()
{
int x,y;
for(int i=1;i<=n;i++)
{
f>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
}
void depth_first(int x)
{
jart[x]=1;
for(int i=1;i<=n;i++)
{
if(a[x][i]==1&&jart[i]==0)
{
d[i]=d[x]+1;
if(d[i]>maxi)
{
maxi=d[i]+1;
hely=i;
}
depth_first(i);
}
}
}
int main()
{
f>>n;
szomszedsagi_matrix();
depth_first(1);
for(int i=1;i<=n;i++)
{
jart[i]=0;
d[i]=0;
}
depth_first(hely);
g<<maxi;
return 0;
}