Pagini recente » Cod sursa (job #2308184) | Cod sursa (job #964890) | Cod sursa (job #1539593) | Cod sursa (job #1140372) | Cod sursa (job #1891531)
#include <iostream>
#include <vector>
#include <fstream>
#define NMAX 100000 + 4
using namespace std;
ifstream in("zvon.in");
ofstream out("zvon.out");
vector<int> graph[NMAX];
int T, n, x, y, ans;
int BFS(int start){
int maxs = 0, maxval = 0, tval;
if(graph[start].size()<1)
return 1;
for(unsigned int i=0;i<graph[start].size();i++){
tval = BFS(graph[start][i]);
if(tval>maxs){
maxval = 1;
maxs = tval;
}
else if(tval == maxs)
maxval++;
}
return maxval + maxs;
}
int main()
{
in>>T;
while(T){
T--;
in>>n;
for(int i=0;i < n-1;i++){
in>>x>>y;
graph[x].push_back(y);
}
ans = BFS(1);
out<<ans - 1<<'\n';
for(int i=0;i<n;i++){
graph[i].clear();
}
ans = 0;
}
return 0;
}