Nu aveti permisiuni pentru a descarca fisierul grader_test19.ok
Cod sursa(job #1341803)
| Utilizator | Data | 13 februarie 2015 09:05:17 | |
|---|---|---|---|
| Problema | Diametrul unui arbore | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.84 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("darb.in");
ofstream fout("darb.out");
vector <int> v[100003];
int viz[100004];
int sel,nr;
void BFS(int x)
{
int i;
for(i=0;i<v[x].size();i++)
if(!viz[v[x][i]])
{
viz[v[x][i]]=viz[x]+1;
if(nr<viz[v[x][i]])
{
nr=viz[x];
sel=x;
}
BFS(v[x][i]);
}
}
int main()
{
int n,i,a,b;
fin>>n;
for(i=1;i<=n-1;i++)
{
fin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
viz[1]=1;
BFS(1);
//cout<<sel;
for(i=1;i<=n;i++)
viz[i]=0;
viz[sel]=1;
nr=0;
BFS(sel);
fout<<nr+2<<'\n';
fin.close();
fout.close();
return 0;
}
