Pagini recente » Cod sursa (job #900812) | Cod sursa (job #2243476) | Cod sursa (job #256130) | Cod sursa (job #1066479) | Cod sursa (job #2133170)
#include<fstream>
#include<vector>
using namespace std;
ifstream in ("darb.in");
ofstream out ("darb.out");
int d[100001],far,n,x,y;
bool hz[100001];
vector<int>v[100001];
void dfs (int nod) {
hz[nod] = 1;
for (int i = 0; i < v[nod].size(); i ++) {
int vecin = v[nod][i];
if (hz[vecin] == 0) {
d[vecin] = d[nod]+1;
dfs (vecin);
}
}
return;
}
int main (void) {
in >> n;
for (int i = 1; i <= n - 1; i ++) {
in >> x >> y;
v[x].push_back (y);
v[y].push_back (x);
}
dfs (1);
for (int i = 1; i <= n; i ++) {
if (d[i] > d[far]) {
far = i;
}
d[i] = 0;
hz[i] = 0;
}
dfs (far);
far = 0;
for (int i = 1; i <= n; i ++) {
if (d[i] > d[far]) {
far = i;
}
}
out << d[far]+1;
return 0;
}