Cod sursa(job #3120542)
Utilizator | Data | 7 aprilie 2023 13:29:37 | |
---|---|---|---|
Problema | Diametrul unui arbore | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("darb.in");
ofstream G("darb.out");
int x,y,t,s;
vector<int> v[100001];
bool z[100001];
void D(int x,int l)
{
if(z[x]=t,l>s)
s=l,y=x;
for(auto j:v[x])
if(z[j]!=t)
D(j,l+1);
}
int main()
{
for(F>>x;F>>x>>y;v[x].push_back(y),v[y].push_back(x));
return t=1,D(1,1),t=0,D(y,1),G<<s,0;
}