Cod sursa(job #3284301)
Utilizator | Data | 11 martie 2025 13:46:21 | |
---|---|---|---|
Problema | Diametrul unui arbore | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("darb.in");
ofstream fout("darb.out");
bitset<100001> vas;
int n,x,y,mx,dx;
vector<vector<int>> graf;
void dfs(int nod,int niv){
vas[nod]=1;
if(niv>mx)mx=niv;
for(int i:graf[nod]){
if(!vas[i]){
dfs(i,niv+1);
}
}
}
void dfs(int nod,int niv){
vas[nod]=1;
if(niv>mx)dx=niv;
for(int i:graf[nod]){
if(!vas[i]){
dfs(i,niv+1);
}
}
}
int main()
{
fin>>n;
for(int i=1;i<n;i++){
fin>>x>>y;
graf[x]=y;
graf[y]=x;
}
dfs()
}