Cod sursa(job #2779625)
| Utilizator | Data | 4 octombrie 2021 14:24:13 | |
|---|---|---|---|
| Problema | Diametrul unui arbore | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("darb.in");
ofstream g("darb.out");
int n,m,x,y,t,s,z[100003],i;
vector<int> v[100003];
void D(int x,int l)
{
z[x]=t;
if(l>s)
s=l,y=x;
int j,k=v[x].size();
for(j=0;j<k;++j)
if(z[v[x][j]]!=t)
D(v[x][j],l+1);
}
int main()
{
f>>n;
for(i=1;i<n;++i)
f>>x>>y,v[x].push_back(y),v[y].push_back(x);
t=1,D(1,1),t=2,D(y,1),g<<s;
return 0;
}
