#include iostream#include queueusing namespace std;struct node{char c;node *left,*right;};int k=0;char a;string s="12300400506700800";node *createtree(){node *p;//cina;a=s[k++];if(a!='.'){p=new node;p-c=a;p-left = createtree();p-right = cre

点我呐

#include iostream#include cstringusing namespace std;struct node{ int id; int n; int t,l,r;} poi[105];int n;int vis[105],ans=2147483647;int getsum(int i,int h){ if(i==0||vis[i]==1) return 0; vis[i]=1; int sum=0; sum+=getsum(poi[i].t,h+1); s

点我呐