OJ Board

lifetime maybe very big.

I don't know whether it wrong because I consider the left child node and right child node as the same.

when I make the tree, for each father node, I put the child node on the left first, and then fill the right node.

I think it's right. But I got WA.Maybe my algorithm is wrong?

There are nothing different between my output and yours.
I got WA.

I have read all the topic about 112,and try all the data correct.I don't know why still wrong answer. Anyone can help me?Thanks a lot!!!!

:cry: :cry: :cry:


Here is my code:

#include<stdio.h>
const long maxn=10000;
char ch,s[maxn+5];
long l,n,m,sz[maxn+5],tree[maxn+5],leaf[maxn+5];

long run ...