Pagini recente » Cod sursa (job #619780) | Cod sursa (job #2854078) | Cod sursa (job #415010) | Cod sursa (job #174739) | Cod sursa (job #1293773)
#include<cstdio>
#include<vector>
#include<cstring>
using namespace std;
const int N=100000;
bool vis[N+1];
vector<int>g[N+1];
int n;
int far,dist,mdist;
void dfs(int dad){
vis[dad]=true;
if(dist>mdist){
mdist=dist;
far=dad;
}
for(int i=0;i<g[dad].size();i++){
int son=g[dad][i];
if(!vis[son]){
dist++;
dfs(son);
dist--;
}
}
}
int main(){
freopen("darb.in","r",stdin);
freopen("darb.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<n;i++){
int x,y;
scanf("%d%d",&x,&y);
g[x].push_back(y);
g[y].push_back(x);
}
dfs(1); memset(vis,0,sizeof(vis));
dfs(far);
printf("%d",mdist+1);
return 0;
}