http://codevs.cn/problem/1501/
做笔记以防遗忘
#include<cstdio>
#include<algorithm>
using namespace std;
int Temp[30],Max_Tall,Max_Wide,Left[100],Right[100];
int Binary_Tree(int Node,int High){
if(Node!=0){
Temp[High]++;//此层节点数加1
Max_Wide=max(Temp[High],Max_Wide);//更新最大宽度
Max_Tall=max(High,Max_Tall);//更新最大高度
/*当更新完最大高度和宽度后需要进行向下查找*/
Binary_Tree(Left[Node],High+1);//查找左边岔道
Binary_Tree(Right[Node],High+1);//查找右边岔道
}
}
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d%d",&Left[i],&Right[i]);
Binary_Tree(1,1);
printf("%d %d\n",Max_Wide,Max_Tall);
}