Pagini recente » Cod sursa (job #2656142) | Cod sursa (job #2789323) | Cod sursa (job #2933823) | Cod sursa (job #2305755) | Cod sursa (job #175699)
Cod sursa(job #175699)
#include <fstream.h>
ifstream fin ("zvon.in");
ofstream fout ("zvon.out");
int sef[10000],t[10000],nrt;
long n;
int main ()
{
fin>>nrt;
int l;
long k,i,j,max;
for (l=1;l<=nrt;l++)
{
fin>>n;
for (k=0;k<n-1;k++)
{
fin>>i>>j;
sef[j]=i;
}
t[1]=1;sef[1]=1;
for (i=2;i<=n;i++)
t[i]=1+t[sef[i]];
max=0;
for (i=2;i<=n;i++)
if (max<t[i]) max=t[i];
fout<<max<<'\n';
}
return 0;
}