poj3437 多叉树转为二叉树

 

#include<iostream>using namespace std;string s;int i,yuan,hou,len=1;void f(int yu,int ho){ int t=0; while(s[i]=='d'){  t++;  i++;  f(yu+1,ho+t); } yuan=yu>yuan? yu:yuan; hou=ho>hou? ho:hou; i++;}int main(){ while(cin>>s&&s[0]!='#'){  i=yuan=hou=0;  f(0,0);  cout<<"Tree "<<len++<<": "<<yuan<<" => "<<hou<<endl; } return 0;}