Pagini recente » Clasament cerculdeinfo-lectia14-cautare_binara | Cod sursa (job #218139) | Cod sursa (job #1834168) | Cod sursa (job #2079416) | Cod sursa (job #2099843)
#include<bits/stdc++.h>
using namespace std;
int n,m,x,y,mx;
int viz[100100];
vector<int>V[100100];
void DFS(int x,int y) {
y++;
viz[x]=y;
if (viz[x]>viz[mx]) mx=x;
for (int i=0; i<V[x].size(); i++) {
if (!viz[V[x][i]]) {
DFS(V[x][i],y);//cout<<'.';
}
}
}
int main() {
ifstream cin("darb.in");
ofstream cout("darb.out");
cin>>n;
for (int i=0; i<n-1; i++) {
cin>>x>>y;
V[x].push_back(y);
V[y].push_back(x);
}
DFS(1,1);
for (int i=1; i<=n; i++) viz[i]=0;
DFS(x,1);
cout<<viz[mx];
return 0;
}