UVa 10562 - Undraw the Trees

看图写树，注意空树。

#include<iostream>
#include<cstdio>
#include<cstring>
#define MAXN 220
using namespace std;

int n;
char tree[MAXN][MAXN];

void get_tree() {
    n = 0;
    while(gets(tree[n])&& tree[n][0] != '#')
        n++;
    return ;
}

void dfs(int r, int c) {
    printf("%c(", tree[r][c]);
    if(r + 1 < n&& tree[r + 1][c] == '|') {
        int i = c;
        for(; i > 0&& tree[r + 2][i - 1] == '-'; i--) ;
        while(tree[r + 2][i] == '-'&& tree[r + 3][i] != '\0') {
            if(!isspace(tree[r + 3][i])) dfs(r + 3, i);
            i++;
        }
    }
    printf(")");
}

void puts_tree() {                         //²âÊÔº¯Êý
    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= strlen(tree[i]); j++)
            printf("%c", tree[i][j]);
        cout << endl;
    }
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
#endif // ONLINE_JUDGE
    int T;
    cin >> T;
    getchar();
    while(T--) {
        memset(tree, 0, sizeof(tree));
        get_tree();                            //¶ÁÈ¡Ê÷
        int i = 0;
        printf("(");
        if(n) {
            for(; tree[0][i] == ' '; i++) ;
            dfs(0, i);
        }
        printf(")\n");
//        puts_tree();
    }
    return 0;
}