Cod sursa(job #3311152)
| Utilizator | Data | 19 septembrie 2025 22:13:41 | |
|---|---|---|---|
| Problema | Diametrul unui arbore | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <vector>
#define nmax (int)(1e5+1)
using namespace std;
ifstream cin("darb.in");
ofstream cout("darb.out");
int n,x,y,d,start;
vector<int>v[nmax];
void dfs(int nod,int t,int l){
if(l>d)
start=nod,d=l;
for(auto i:v[nod])
if(i!=t)
dfs(i,nod,l+1);
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1,0,1);
d=0;
dfs(start,0,1);
cout<<d;
return 0;
}
