uva 10562 - Undraw the Trees

Professor Homer has been reported missing. We suspect that his recent research works might have had something to with this. But we really don't know much about what he was working on! The detectives tried to hack into his computer, but after hours of failed efforts they realized that the professor had been lot more intelligent than them. If only they could realize that the professor must have been absent minded they could get the clue rightaway. We at the crime lab were not at all surprised when the professor's works were found in a 3.5" floppy disk left inside the drive.

The disk contained only one text file in which the professor had drawn many trees with ASCII characters. Before we can proceed to the next level of investigation we would like to match the trees drawn with the ones that we have in our database. Now you are the computer geek -- we leave this trivial task for you. Convert professor's trees to our trees.

Professor's Trees

The first line of the input file (which you can assume comes from standard input) contains the number of trees, T (1 <= T <= 20)drawn in the file. Then you would have T trees, each ending with a single hash ('#') mark at the beginning of the line. All the trees drawn here are drawn vertically in top down fashion. The labels of each of node can be any printable character except for the symbols '-', '|', ' ' (space) and '#'. Every node that has children has a '|' symbol drawn just below itself. And in the next line there would be a series of '-' marks at least as long as to cover all the immediate children. The sample input section will hopefully clarify your doubts if there is any. No tree drawn here requires more than 200 lines, and none of them has more than 200 characters in one line.

Our Trees

Our trees are drawn with parenthesis and the node labels. Every subtree starts with an opening parenthesis and ends with a closing parenthesis; inside the parenthesis the node labels are listed. The sub trees are always listed from left to right. In our database each tree is written as a single string in one line, and they do not contain any character except for the node labels and the parenthesis pair. The node labels can be repeated if the original tree had such repetitions.

 

 

Sample Professor’s Trees      Corresponding Our Trees

2     A     | -------- B  C   D    |   |  ----- -  E   F G # e | ---- f g #

(A(B()C(E()F())D(G()))) (e(f()g()))

这题我是参照了别人的读取思路，因为对这种比较字符串读取的题感觉不太了解，看了别人递归读取思路后，算是豁然开朗了，题目还是挺容易的，关键是得熟悉二叉树那种先序读取的特色，然后写出递归是就好，当然其中还是有一些细心的地方需要注意下，因为WA了好几遍：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int st;
char str[205][205];
void dfs(int x,int y){
    for(int i=y;str[x][i]=='-';i++)
        if(str[x+1][i]!=' '&&str[x+1][i]!='\0'){//代表有节点 
            printf("%c(",str[x+1][i]);
            if(x+1<st&&str[x+2][i]=='|'){
                int j;
                for(j=i;j&&str[x+3][j-1]=='-';j--);//为上面的递归作准备找到最靠左的'-'下标, 
                    dfs(x+3,j);  //这里需要注意的就是j-1，之前我写的是str[x+3][j],dfs(x+3,j+1),但这里忽略了j从一开始就为0的情况，所以这里的注意 
            }      
            printf(")");
        }   
} 
int main(){
    int t;
    scanf("%d",&t);
    getchar();
    while(t--){
        st=1;
        memset(str,0,sizeof(str));
        while(1){
           gets(str[st++]);
           if(strcmp(str[st-1],"#")==0)break;           
        }
        st--;
        if(st==1)printf("()\n");
        else{ 
            for(int i=0;i<strlen(str[1]);i++)str[0][i]='-'; 
            printf("(");//提前写括号是为了方便后面递归的时候写叶节点的空括号，挺巧妙的 
            dfs(0,0);//开始递归 
            printf(")\n");
        }
    }       
    return 0;
}