UVA10562-Undraw the Trees（递归）

Problem UVA10562-Undraw the Trees

Accept: 1199  Submit: 8397

Time Limit: 3000 mSec

Problem Description

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.

 Input

The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing a single integer number N that indicates the number of plates (1 ≤ N ≤ 100000). Then exactly N lines follow, each containing a single word. Each word contains at least two and at most 1000 lowercase characters, that means only letters ‘a’ through ‘z’ will appear in the word. The same word may appear several times in the list.

 Output

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.

 Sample Input

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

Sample output

(A(B()C(E()F())D(G())))

(e(f()g()))

题解：记录下来这个题主要是为了记录一个C语言学的时候不太注意的一个点，就是'\0'在isspace下是false，因此如果不在'\0'处break，就会出现一些神奇的错误。

别的就是一些简单的递归的东西，不赘述。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <string>
 using namespace std;
 
 const int maxn = +;
 string gra[maxn];
 int n;
 
 void dfs(int x,int y){
     printf("%c(",gra[x][y]);
     if(x+<n && gra[x+][y]=='|'){
         int yl = y,yr = y;
         while(yl->= && gra[x+][yl-]=='-') yl--;
         while(yr+<gra[x+].size() && gra[x+][yr+]=='-') yr++;
         for(int j = yl;j <= yr;j++){
             if(gra[x+][j] == '\0') break;
             if(!isspace(gra[x+][j])) dfs(x+,j);
         }
     }
     printf(")");
 }
 
 void solve(){
     printf("(");
     if(n){
         for(int j = ;j < (int)gra[].size();j++){
             if(!isspace(gra[][j])){
                 dfs(,j);
                 break;
             }
         }
     }
     printf(")\n");
 }
 
 int main()
 {
     //freopen("input.txt","r",stdin);
     //freopen("output.txt","w",stdout);
     int iCase;
     scanf("%d",&iCase);
     getchar();
     while(iCase--){
         for(int i = ;i < maxn;i++) gra[i].clear();
         n = ;
         while(getline(cin,gra[n++]) && gra[n-][] != '#'){};
         n--;
         solve();
     }
     return ;
 }