UVA - 10562 Undraw the Trees（多叉树的dfs）

题意：将多叉树转化为括号表示法。

分析：gets读取，dfs就好了。注意，样例中一行的最后一个字母后是没有空格的。

#pragma comment(linker, "/STACK:102400000, 102400000")
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<iostream>
#include<sstream>
#include<iterator>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#define Min(a, b) ((a < b) ? a : b)
#define Max(a, b) ((a < b) ? b : a)
typedef long long ll;
typedef unsigned long long llu;
const int INT_INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const int dr[] = {, , -, , -, -, , };
const int dc[] = {-, , , , -, , -, };
const int MOD = 1e9 + ;
const double pi = acos(-1.0);
const double eps = 1e-;
const int MAXN =  + ;
const int MAXT =  + ;
using namespace std;
char s[MAXN][MAXN];
int cnt;
void dfs(int x, int y){
    printf("%c(", s[x][y]);
    if(x == cnt){
        return;
    }
    if(s[x + ][y] == '|'){//有子树
        int st = y;
        int et = y;
        while(s[x + ][st - ] == '-' && st -  >= ) --st;//找左边界,且要保证下标不为负数
        while(s[x + ][et] == '-') ++et;//找右边界
        for(int j = st; j < et && s[x + ][j] != '\0'; ++j){//横线的右边界下不一定有结点，所以s[x + 3][j] != '\0'
            if(!isspace(s[x + ][j])){
                dfs(x + , j);
                printf(")");
            }
        }
    }
}
int main(){
    //freopen("in.txt", "r", stdin);
    int T;
    scanf("%d", &T);
    getchar();
    while(T--){
        memset(s, , sizeof s);
        cnt = ;
        while(gets(s[cnt])){//gets读入
            if(s[cnt][] == '#') break;
            ++cnt;
        }
        printf("(");
        int len = strlen(s[]);
        for(int j = ; j < len; ++j){
            if(cnt == ) break;//空树
            if(!isspace(s[][j])){//是结点
                dfs(, j);
                printf(")");
            }
        }
        printf(")\n");
    }
    return ;
}