#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdio>
using namespace std;
int dp[10005];
int main(){
int n,x,y;
memset(dp,0,sizeof(dp));
scanf("%d",&n);
dp[0]=1;
for(int i=0;i<n;++i){
scanf("%d %d",&x,&y);
if(x!=0&&y!=0)
dp[y-1]=dp[x-1]=dp[i]+1;
else if(x==0&&y!=0)
dp[y-1]=dp[i]+1;
else if(y==0&&x!=0)
dp[x-1]=dp[i]+1;
}
std::sort(dp,dp+n);
printf("%d\n",dp[n-1]);
}
我不说话只贴代码。 纪念一下