Pagini recente » Cod sursa (job #2192274) | Cod sursa (job #1517626) | Cod sursa (job #1738493) | Cod sursa (job #2201887) | Cod sursa (job #3166507)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("darb.in");
ofstream cout("darb.out");
int ultim, lg;
vector<int> v[100002];
bool viz[100002];
void dfs(int nod, int lungime);
int main()
{
int n;
cin >> n;
for(int i = 1; i <= n - 1; i++)
{
int x, y;
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1, lg);
///cout << ultim << '\n';
lg = 0;
for(int i = 1; i <= n; i++)
viz[i] = 0;
dfs(ultim, lg + 1);
cout << lg << '\n';
return 0;
}
void dfs(int nod, int lungime)
{
viz[nod] = 1;
if(lungime > lg)
{
lg = lungime;
ultim = nod;
}
for(auto x : v[nod])
{
if(!viz[x])
dfs(x, lungime + 1);
}
}