Pagini recente » Cod sursa (job #1516006) | Cod sursa (job #488443) | Cod sursa (job #2908596) | Cod sursa (job #1474339) | Cod sursa (job #1383970)
#include<fstream>
#include<vector>
#define NMax 100005
using namespace std;
ifstream f("darb.in");
ofstream g("darb.out");
vector <int> G[NMax],GT[NMax];
int Dist[NMax],TT[NMax];
int n,rad;
void Citire()
{
int i,x,y;
f>>n;
for(i=1;i<n;i++){
f>>x>>y;
TT[y]=x;
G[x].push_back(y);
G[y].push_back(x);
}
for(i=1;i<n;i++)
if(TT[i]==0){
rad=i;
break;
}
}
void DFS(int Nod)
{
int Vecin,i;
for(i=0;i<G[Nod].size();i++){
Vecin=G[Nod][i];
if(Dist[Vecin]==0){
Dist[Vecin]=Dist[Nod]+1;
DFS(Vecin);
}
}
}
int main()
{
int maxi=0,in,i;
Citire();
DFS(rad);
for(i=1;i<=n;i++)
if(Dist[i]>maxi){
maxi=Dist[i];
in=i;
}
for(i=1;i<=n;i++)
Dist[i]=0;
DFS(in);
for(i=1;i<=n;i++)
if(Dist[i]>maxi)
maxi=Dist[i];
g<<maxi+1<<"\n";
return 0;
}