Pagini recente » Cod sursa (job #1881498) | Cod sursa (job #2978754) | Cod sursa (job #1465167) | Cod sursa (job #1797599) | Cod sursa (job #2668575)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("darb.in");
ofstream fout("darb.out");
//#define fin cin
int node;
vector<vector<int>> legs;
vector<int> viz;
int md;
int dfs(int n, int d){
if(d>md){
md=d;
node=n;
}
if(legs[n].size()==2){
if(viz[legs[n][0]]==0){
dfs(legs[n][0],d+1);
}
else{
dfs(legs[n][1],d+1);
}
}
}
int main(){
int n,x,y;
fin>>n;
legs.resize(n);
for(int i=0;i<n-1;++i){
fin>>x>>y;
legs[x].push_back(y);
legs[y].push_back(x);
}
dfs(1,1);
md=1;
dfs(node,1);
fout<<md<<"\n";
fin.close();
fout.close();
return 0;
}