Cod sursa(job #2170787)
Utilizator | Data | 15 martie 2018 09:45:58 | |
---|---|---|---|
Problema | Diametrul unui arbore | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f ("darb.in");
ofstream g ("darb.out");
vector <int> v[100003];
int mare,m,n,a,b;
void dfs(int nod,int ant,int lvl)
{
if(lvl>mare)
{
mare=lvl;
m=nod;
}
for(int i=0;i<v[nod].size();++i)
{
if(v[nod][i]!=ant) dfs(v[nod][i],nod,lvl+1);
}
}
int main()
{
f>>n;
for(int i=1;i<n;++i)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
dfs(1,0,1);
dfs(m,0,1);
g<<mare;
return 0;
}